Digital television transmitting system and receiving system and method of processing broadcasting data

ABSTRACT

A digital television (DTV) transmitting system includes a first frame decoder, a second frame decoder, and a frame multiplexer. The first frame decoder forms first enhanced data frames, encodes each data frame for error correction, forms a first super frame by combining the encoded first frames, and interleaves the first super frame. The second frame decoder forms second enhanced data frames, encodes each data frame for error correction, forms a second super frame by combining the encoded second frames, and interleaves the second super frame. The frame multiplexer multiplexes the interleaved first and second enhanced data frames.

This application claims the benefit of the Korean Patent Application No.10-2006-0108038 filed on Nov. 2, 2006, which is hereby incorporated byreference as if fully set forth herein. This application also claims thebenefit of U.S. Provisional Application No. 60/829,271, filed on Oct.12, 2006, which is hereby incorporated by reference. Also, Thisapplication also claims the benefit of U.S. Provisional Application No.60/884,208, filed on Jan. 9, 2007, which is hereby incorporated byreference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a digital television (DTV) transmittingsystem and a DTV receiving system and a method of processing broadcastdata.

2. Discussion of the Related Art

Presently, the technology for processing digital signals is beingdeveloped at a vast rate, and, as a larger number of the population usesthe Internet, digital electric appliances, computers, and the Internetare being integrated. Therefore, in order to meet with the variousrequirements of the users, a system that can transmit diversesupplemental information in addition to video/audio data through adigital television channel needs to be developed.

Some users may assume that supplemental data broadcasting would beapplied by using a PC card or a portable device having a simple in-doorantenna attached thereto. However, when used indoors, the intensity ofthe signals may decrease due to a blockage caused by the walls ordisturbance caused by approaching or proximate mobile objects.Accordingly, the quality of the received digital signals may bedeteriorated due to a ghost effect and noise caused by reflected waves.However, unlike the general video/audio data, when transmitting thesupplemental data, the data that is to be transmitted should have a lowerror ratio. More specifically, in case of the video/audio data, errorsthat are not perceived or acknowledged through the eyes or ears of theuser can be ignored, since they do not cause any or much trouble.Conversely, in case of the supplemental data (e.g., program executionfile, stock information, etc.), an error even in a single bit may causea serious problem. Therefore, a system highly resistant to ghost effectsand noise is required to be developed.

The supplemental data are generally transmitted by a time-divisionmethod through the same channel as the video/audio data. However, withthe advent of digital broadcasting, digital television receiving systemsthat receive only video/audio data are already supplied to the market.Therefore, the supplemental data that are transmitted through the samechannel as the video/audio data should not influence the conventionalreceiving systems that are provided in the market. In other words, thismay be defined as the compatibility of broadcast system, and thesupplemental data broadcast system should be compatible with thebroadcast system. Herein, the supplemental data may also be referred toas enhanced data. Furthermore, in a poor channel environment, thereceiving performance of the conventional receiving system may bedeteriorated. More specifically, resistance to changes in channels andnoise is more highly required when using portable and/or mobilereceivers.

SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to a digital broadcastingsystem and a data processing method that substantially obviate one ormore problems due to limitations and disadvantages of the related art.

An object of the present invention is to provide a digital televisionsystem that is suitable for transmitting supplemental data and that ishighly resistant to noise.

Another object of the present invention is to provide a digitalbroadcasting system and a data processing method that can performadditional encoding on enhanced data and transmitting the processedenhanced data, thereby enhancing the performance of the receivingsystem.

Additional advantages, objects, and features of the invention will beset forth in part in the description which follows and in part willbecome apparent to those having ordinary skill in the art uponexamination of the following or may be learned from practice of theinvention. The objectives and other advantages of the invention may berealized and attained by the structure particularly pointed out in thewritten description and claims hereof as well as the appended drawings.

To achieve these objects and other advantages and in accordance with thepurpose of the invention, as embodied and broadly described herein, adigital television (DTV) transmitting system includes a first frameencoder, a second frame encoder, and a frame multiplexer. The firstframe encoder forms a plurality of first enhanced data frames andencodes each first enhanced data frame for error correction. The firstframe encoder further forms a first super frame by combining the encodedfirst enhanced data frames and interleaves the first super frame.Similarly, the second frame encoder forms a plurality of second enhanceddata frames and encodes each second enhanced data frame for errorcorrection. The second frame encoder further forms a second super frameby combining the encoded second enhanced data frames and interleaves thesecond super frame. The frame multiplexer then multiplexes theinterleaved first enhanced data frames with the interleaved secondenhanced data frames.

In another aspect of the present invention, a digital television (DTV)receiving system includes a tuner, a demodulator, an equalizer, a blockdecoder, a frame demultiplexer, a first frame decoder, and a secondframe decoder. The tuner receives a digital broadcast signal containingenhanced data and main data. The demodulator demodulates the digitalbroadcast signal, and the equalizer performs channel equalization on thedemodulated signal. The block decoder decodes each block of enhanceddata in the equalized signal, and the frame demultiplexer demultiplexesthe decoded enhanced data into first and second super frames. The firstframe decoder deinterleaves the first super frame and decodes each offirst enhanced data frames included in the first super frame for errorcorrection. Similarly, the second frame decoder deinterleaves the secondsuper frame and decodes each of second enhanced data frames included inthe second super frame for error correction.

It is to be understood that both the foregoing general description andthe following detailed description of the present invention areexemplary and explanatory and are intended to provide furtherexplanation of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention and are incorporated in and constitute apart of this application, illustrate embodiment(s) of the invention andtogether with the description serve to explain the principle of theinvention. In the drawings:

FIG. 1 illustrates a pre-processor within a transmitting systemaccording to an embodiment of the present invention;

FIG. 2 illustrates a pre-processor within a transmitting systemaccording to another embodiment of the present invention;

FIG. 3 illustrates a block diagram of a transmitting system according toan embodiment of the present invention;

FIG. 4(a) to FIG. 4(e) illustrate examples showing the steps of an errorcorrection coding process and an error detection coding processaccording to an embodiment of the present invention;

FIG. 5(a) to FIG. 5(d) illustrate examples showing the steps of an errorcorrection coding process according to another embodiment of the presentinvention;

FIG. 6(a) to FIG. 6(d) illustrates an interleaving process in superframe units according to an embodiment of the present invention;

FIG. 7 and FIG. 8 respectively illustrate a data configuration beforeand after a data deinterleaver with the transmitting system according tothe present invention;

FIG. 9(a) and FIG. 9(b) each illustrates an exemplary process ofdividing a RS frame in order to configure a data group according to anembodiment of the present invention;

FIG. 10 illustrates exemplary operations of a packet multiplexer fortransmitting a data group according to the present invention;

FIG. 11 illustrates a demodulating unit within a receiving systemaccording to an embodiment of the present invention;

FIG. 12 and FIG. 13 respectively illustrate different examples of anenhanced data processing unit according to the present invention;

FIG. 14 to FIG. 16 respectively illustrate different examples of adecoding process of a RS frame decoder according to the presentinvention;

FIG. 17 illustrates a block diagram showing a structure of a receivingsystem according to an embodiment of the present invention; and

FIG. 18 illustrates a block diagram showing a structure of a receivingsystem according to another embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the preferred embodiments of thepresent invention, examples of which are illustrated in the accompanyingdrawings. Wherever possible, the same reference numbers will be usedthroughout the drawings to refer to the same or like parts. In addition,although the terms used in the present invention are selected fromgenerally known and used terms, some of the terms mentioned in thedescription of the present invention have been selected by the applicantat his or her discretion, the detailed meanings of which are describedin relevant parts of the description herein. Furthermore, it is requiredthat the present invention is understood, not simply by the actual termsused but by the meaning of each term lying within.

In the present invention, the enhanced data may either consist of dataincluding information such as program execution files, stockinformation, weather forecast, and so on, or consist of video/audiodata. Additionally, the known data refer to data already known basedupon a pre-determined agreement between the transmitting system and thereceiving system. Furthermore, the main data consist of data that can bereceived from the conventional receiving system, wherein the main datainclude video/audio data. By performing additional encoding on theenhanced data and by transmitting the processed data, the presentinvention may provide robustness to the enhanced data, thereby enablingthe data to respond more effectively to the channel environment thatundergoes frequent changes. Particularly, in the present invention, thedigital broadcast transmitting system (or digital broadcast transmitter)receives a plurality of enhanced data sets having other serviceinformation included therein. Thus, the transmitting systemindependently performs additional encoding processes and transmits theadditionally processed data. A digital broadcast receiving system (ordigital broadcast receiver) receives the processed data beingtransmitted, so as to decode the processed data.

FIG. 1 and FIG. 2 illustrates examples of a portion of the transmittingsystem (or transmitter) for receiving various types of enhanced data andindependently performing additional encoding processes according to thepresent invention. Referring to FIG. 1, the transmitting system includesa pre-processor 100 and a packet multiplexer 121. The pre-processor 100includes the same number of randomizers and RS frame encoders. Herein,the number corresponds to the type (or number of sets) of enhanced data,which are to be processed with additional encoding. The alignment orderof the randomizers ad RS frame encoders may vary in accordance with thedesign of the system designer. For example, an RS frame encoder may bepositioned behind a randomizer. Alternatively, a randomizer may bepositioned behind a RS frame encoder.

An example of a RS frame encoder being positioned behind a randomizerwill now be described in detail as an embodiment of the presentinvention. In this example, each enhanced data set that is to beindependently encoded is inputted to its respective randomizer throughdifferent paths. Herein, each enhanced data set that is being inputtedto each randomizer through a different path may correspond to enhanceddata each having different types of services included therein.Alternatively, each enhanced data set may also correspond to enhanceddata having the same service type included therein. However, in thiscase, each enhanced data set is independently randomized by therandomizer and is then encoded in RS frame units. For example, thetransmitting system according to the present invention may receive anenhanced data set including stock information and an enhanced data setincluding weather information through different paths. Then, thereceived enhanced data sets are sequentially processed independentrandomizing and RS encoding processes. Furthermore, internal parametersof the RS frame encoders respectively performing RS frame encoding oneach enhanced data set being randomized by each randomizer may varydepending upon priority levels or levels of importance of the enhanceddata sets that are being inputted.

In the example of the present invention, first to third enhanced datasets enhanced data 1 to enhanced data 3 are inputted to first to thirdenhanced data randomizers 101 a to 101 c through each respective path.Furthermore, first to third RS encoders 102 a to 102 c are respectivelypositioned at the output end of the first to third enhanced datarandomizer 101 a to 101 c. A RS frame multiplexer 103 is mutuallyprovided at the output ends of the first to third RS frame encoders 102a to 102 c. Herein, the RS frame multiplexer 103 multiplexes theenhanced data RS encoded by the first to third RS frame encoders 102 ato 102 c in RS frame units and outputs the multiplexed data. Then, ablock processor 104, a group formatter 105, a data deinterleaver 106,and a packet formatter 107 are sequentially provided after the RS framemultiplexer 103.

In the present invention having the structure as shown in FIG. 1, thefirst to third enhanced data sets are respectively inputted to the firstto third enhanced data randomizers 101 a to 101 c through differentpaths and then randomized, respectively. More specifically, by havingeach enhanced data randomizer 101 a to 101 c of the pre-processor 100randomize the enhanced data, the randomizing process that is to beperformed on the enhanced data by the randomizer positioned behind thepacket multiplexer 121 may be omitted. The enhanced data setsrespectively randomized by the first to third enhanced data randomizers101 a to 101 c are, then, inputted to the first to third RS frameencoders 102 a to 102 c, respectively. Each of the first to third RSframe encoders 102 a to 102 c groups a plurality of randomized enhanceddata bytes that are being inputted, thereby creating a RS frame,respectively. Then, each RS frame encoder performs an error correctionencoding in RS frame units. At this point, an error detection encodingprocess may or may not be performed. Thus, by providing robustness tothe enhanced data, the corresponding data may respond to the severelyvulnerable and frequently changing frequency environment.

Each of the first to third RS frame encoders 102 a to 102 c may group aplurality of RS frames to create a super frame so as to performinterleaving or permutation in super frame units. Thus, by providingrobustness to the enhanced data, a group error that may occur due to achange in the frequency environment may be scattered, thereby enablingthe corresponding data to respond to the severely vulnerable andfrequently changing frequency environment. Hereinafter, the process ofcreating a RS frame and the process of performing error correctionencoding in RS frame units by each RS frame encoder will now bedescribed in detail with reference to FIG. 4 and FIG. 5. Morespecifically, FIG. 4 illustrates an example of performing errordetection encoding after performing error correction encoding, therebyadding a checksum. And, FIG. 5 illustrates an example of omitting theerror detection encoding process.

In the present invention, RS encoding is applied as the error correctionencoding process, and cyclic redundancy check (CRC) encoding is appliedas the error detection encoding process. When performing RS encoding,parity data that are to be used for error correction are generated. And,when performing CRC encoding, CRC data that are to be used for errordetection are generated. Other error detection encoding methods may beused instead of CRC encoding for error detection encoding process. Also,an error correction encoding method may be used to enhance the overallerror correction performance in the receiving system.

Referring to FIG. 4 and FIG. 5, the operations of one of the pluralityof RS frame encoders (e.g., the first RS frame encoder 102 a) will bedescribed in detail. In case of the other RS frame encoders (e.g., thesecond and third RS frame encoders 102 b and 102 c), the internalparameters may vary. However, since the basic operations are identicalto that of the first RS frame encoder 102 a, detailed description of thesame will be omitted for simplicity.

FIG. 4(a) to FIG. 4(e) illustrate examples showing the steps of anencoding process performed by the RS frame encoder according to anembodiment of the present invention. More specifically, the RS frameencoder 102 a first divides the inputted enhanced data bytes into unitsof an equal length A. Herein, the value A will be decided by the systemdesigner. Accordingly, in the example of the present invention givenherein, the specific length is equal to 187 bytes. Herein, the 187-byteunit will be referred to as a “packet” for simplicity. For example, ifthe enhanced data being inputted as shown in FIG. 4(a) correspond to aMPEG transport stream (TS) packet configured of 188-byte units, thefirst MPEG synchronization byte is removed, as shown in FIG. 4(b),thereby configuring a packet with 187 bytes.

Herein, the MPEG synchronization bytes are removed because each of theenhanced data packets has the same value. Furthermore, the process ofremoving the MPEG synchronization bytes may be performed while theenhanced data randomizer 101 a randomizes the enhanced data. Herein, theRS frame encoder 102 a may omit the process of removing the MPEGsynchronization bytes. And, in this case, when the receiving system (orreceiver) adds the MPEG synchronization bytes to the data, thederandomizer performs the process instead of the RS frame decoder.Therefore, if a fixed byte that can be removed is not included in theinputted enhanced data, or if the length of the inputted packet is notequal to 187 bytes, the enhanced data that are being inputted aredivided into 187-byte units, thereby configuring a packet of 187 bytes.

Subsequently, N number of packets configured of 187 bytes is grouped toform a RS frame, as shown in FIG. 4(c). At this point, an RS frame maybe configured by serially inserting a 187-byte packet into a RS framehaving the size of N(rows)*187(columns). Herein, each column of N numberof RS frames includes 187 bytes, as shown in FIG. 4(c). Therefore, inthe present invention, a ((187+P),187)-RS encoding process is performedon each column, so as to generate P number of data bytes. Then, thegenerated P number of data bytes are added to the corresponding columnbehind the last data byte of the column, thereby creating a column of(187+P) bytes. Also, when the ((187+P),187)-RS encoding process isperformed, as shown in FIG. 4(d), on all N number of columns, shown inFIG. 4(c), a RS frame having the size of N(rows)*(187+P) (columns)number of bytes may be created.

As shown in FIG. 4(c) or FIG. 4(d), each row of the RS frame isconfigured of N number of data bytes. However, depending upon channelconditions between the transmitting system and the receiving system,error may be included in the RS frame. When errors occur as describedabove, a checksum may be added to each row unit in order to verifywhether error exists in each row unit. Herein, for example, CRC data (orCRC code or CRC checksum) may be used as the checksum. The RS frameencoder 102 a performs CRC encoding on the enhanced data being RSencoded so as to create (or generate) the checksum (e.g., the CRCchecksum). The CRC checksum that is generated by CRC encoding processmay be used to indicate whether the enhanced data have been damagedwhile being transmitted through the channel.

As described above, the present invention may also use different errordetection encoding methods other than the CRC encoding method.Alternatively, the present invention may use the error correctionencoding method to enhance the overall error correction ability of thereceiving system. FIG. 4(e) illustrates an example of using a 2-byte(i.e., 16-bit) CRC checksum as the CRC data. Herein, a 2-byte CRCchecksum is generated for N number of bytes of each row, thereby addingthe 2-byte CRC checksum at the end of the N number of bytes. Thus, eachrow is expanded to (N+2) number of bytes. Equation 1 below correspondsto an exemplary equation for generating a 2-byte CRC checksum for eachrow being configured of N number of bytes.g(x)=x ¹⁶ +x ¹² +x ⁵+1  Equation 1

The process of adding a 2-byte checksum in each row is only exemplary.Therefore, the present invention is not limited only to the exampleproposed in the description set forth herein. As described above, whenthe process of RS encoding and CRC encoding are completed, the(187*N)-byte RS frame is expanded to a ((N+2)*(187+P))-byte RS frame.

Meanwhile, FIG. 5 illustrates another example of a RS frame encodingprocess of the RS frame encoder 102 a, wherein the error detectionencoding process is omitted. In the example shown in FIG. 5, the processof creating one packet by grouping A number of enhanced data bytes(e.g., 187 enhanced data bytes) is identical to the process described inFIG. 4. More specifically, when the enhanced data being inputtedcorrespond to a MPEG transport stream (TS) configured in 188-byte units,as shown in FIG. 5(a), a first MPEG synchronization data byte is removed(or deleted) in order to configure a packet formed of 187 data bytes, asshown in FIG. 5(b).

However, since the error detection encoding process is not performed inthe example shown in FIG. 5, (N+2) number of packets, each configured of187 data bytes, as shown in FIG. 5(c), is grouped so as to form one RSframe. At this point, an RS frame may be configured by seriallyinserting a 187-byte packet into a RS frame having the size of(N+2)(rows)*187(columns). Herein, each column of (N+2) number of RSframes includes 187 bytes, as shown in FIG. 5(c). Therefore, in thepresent invention, a ((187+P),187)-RS encoding process is performed oneach column, so as to generate P number of data bytes. Then, thegenerated P number of data bytes are added to the corresponding columnbehind the last data byte of the column, thereby creating a column of(187+P) bytes. Also, when the ((187+P),187)-RS encoding process isperformed, as shown in FIG. 5(d), on all (N+2) number of columns, shownin FIG. 5(c), a RS frame having the size of (N+2)(rows)*(187+P)(columns)number of bytes may be created.

More specifically, the size of the RS frame being processed with errorcorrection encoding and error detection encoding, as shown in FIG. 4, isthe same as the size of the RS frame being process with error correctionencoding, as shown in FIG. 5. Herein, the value of P may have the samevalue for each RS frame encoder 102 a to 102 c. Alternatively, dependingupon the type of the encoded enhanced data, the value P may havedifferent values. For example, the value P of the first RS frame encoder102 a may be set to be equal to 48 (i.e., P=48), and the value P of thesecond RS frame encoder 102 b may be set to be equal to 36 (i.e., P=36).If the value P is set to be equal to 48 is the first RS frame encoder102 a, (235,187)-RS encoding is performed on each column, therebycreating 48 parity data bytes.

Based upon an error correction scenario of a RS frame, the data byteswithin the RS frame are transmitted through a channel in a rowdirection. At this point, when a large number of errors occur during alimited period of transmission time, errors also occur in a rowdirection within the RS frame being processed with a decoding process inthe receiving system. However, in the perspective of RS encodingperformed in a column direction, the errors are shown as beingscattered. Therefore, error correction may be performed moreeffectively. At this point, a method of increasing the number of paritydata bytes (P) may be used in order to perform a more intense errorcorrection process. However, using this method may lead to a decrease intransmission efficiency. Therefore, a mutually advantageous method isrequired. Furthermore, when performing the decoding process, an erasuredecoding process may be used to enhance the error correctionperformance.

The RS frame encoder according to the present invention also performs aninterleaving process in super frame units in order to further enhancethe error correction performance when error correction the RS frame.FIG. 6 illustrates an example of performing an interleaving process insuper frame units according to the present invention. More specifically,G number of RS frames encoded as shown in FIG. 4 or FIG. 5 is grouped toform a super frame, as shown in FIG. 6(a). At this point, since each RSframe is formed of (N+2)*(187+P) number of bytes, one super frame isconfigured to have the size of (N+2)*(187+P)*G bytes.

When an interleaving process permuting each column of the super frameconfigured as described above is performed based upon a pre-determinedinterleaving rule, the positions of the rows prior to and after beinginterleaved within the super frame may be altered. More specifically,the i^(th) row of the super frame prior to the interleaving process, asshown in FIG. 6(b), is positioned in the j^(th) row of the same superframe after the interleaving process. The above-described relationbetween i and j can be easily understood with reference to aninterleaving rule as shown in Equation 2 below.j=G(i mod(187+P))+└i/(187+P)┘i=(187+P)(j mod G)+└j/G┘where 0≦i,j<(187+P)G−1  Equation 2

Herein, each row of the super frame is configured of (N+2) number ofdata bytes even after being interleaved in super frame units.

When all interleaving process in super frame units are completed, thesuper frame is once again divided into G number of interleaved RSframes, as shown in FIG. 6(d). Herein, the number of RS parity bytes andthe number of columns should be equally provided in each of the RSframes, which configure a super frame. As described in the errorcorrection scenario of a RS frame, in case of the super frame, a sectionhaving a large number of error occurring therein is so long that, evenwhen one RS frame that is to be decoded includes an excessive number oferrors (i.e., to an extent that the errors cannot be corrected), sucherrors are scattered throughout the entire super frame. Therefore, incomparison with a single RS frame, the decoding performance of the superframe is more enhanced.

As described above, the enhanced data being encoded on RS frame unitsand interleaved in super frame units by each of the RS frame encoders102 a to 102 c are outputted to the RS frame multiplexer 103. The RSframe multiplexer 103 multiplexes the enhanced data being respectivelyoutputted from the first to third RS frame encoders 102 a to 102 c in RSframe units. Then, the multiplexed enhanced data are outputted to theblock processor 104. The block processor 104 encodes the encoded andinterleaved enhanced data at a coding rate of G/H. Afterwards, theG/H-rate encoded enhanced data are outputted to the group formatter 105.More specifically, the block processor 104 divides the enhanced data,which are being inputted, into byte units. Then, G number of bits isencoded to H number of bits. Thereafter, the encoded bits are convertedback to byte units and then outputted. For example, if 1 bit of theinput data is coded to 2 bits and outputted, then G is equal to 1 and His equal to 2 (i.e., G=1 and H=2). Alternatively, if 1 bit of the inputdata is coded to 4 bits and outputted, then G is equal to 1 and H isequal to 4 (i.e., G=1 and H=4). Hereinafter, the former coding rate willbe referred to as a coding rate of ½ (½-rate coding), and the lattercoding rate will be referred to as a coding rate of ¼ (¼-rate coding),for simplicity.

Herein, when using the ¼ coding rate, the coding efficiency is greaterthan when using the ½ coding rate, and may, therefore, provide greaterand enhanced error correction ability. For such reason, when it isassumed that the data encoded at a ¼ coding rate in the group formatter105, which is located near the end portion of the system, are allocatedto an area in which the receiving performance may be deteriorated, andthat the data encoded at a ½ coding rate are allocated to an area havingexcellent receiving performance, the difference in performance may bereduced. At this point, the block processor 104 may also receivesupplemental information data, such as signaling information includingsystem information. Herein, such supplemental information data may alsobe processed with either ½-rate coding or ¼-rate coding as in the stepof processing enhanced data. Thereafter, the signaling information isalso considered as being the same as the enhanced data and processedaccordingly.

More specifically, the supplemental information data may be inputted tothe block processor 104 by passing through the randomizer and the RSframe encoder. Alternatively, the supplemental information data may alsobe directly outputted to the block processor 104 bypassing therandomizer and the RS frame encoder. Herein, the signaling informationcorresponds to information required by the receiving system (orreceiver) to receive and process data included in the data group. Suchrequired information may include data group information, multiplexinginformation, and burst information. The signaling information will bedescribed in more detail in a later process.

Meanwhile, the group formatter 105 inserts the enhanced data beingoutputted from the block processor 104 into a corresponding regionwithin a data group being formed in accordance with a pre-defined rule.(Herein, the enhanced data may include supplemental information such assignaling data having transmission information included therein.)Additionally, with respect to the data deinterleaving process, variousdata place holders or known data sets are also inserted in correspondingregions within the data group. At this point, the data group may bedivided into one or more hierarchical regions. Herein, different datatypes may be allocated to different regions in accordance with thecharacteristic of each hierarchically divided region.

FIG. 7 illustrates an alignment of data prior to beingdata-deinterleaved. FIG. 8 illustrates an alignment of data after beingdata-deinterleaved. In other words, FIG. 7 illustrates a configurationof data that are interleaved, and FIG. 8 illustrates a configuration ofdata that are not yet interleaved. More specifically, FIG. 7 illustratesan example of a data group corresponding to the data configuration priorto being data-deinterleaved being broadly divided into three regions.Herein, each of the three regions will be respectively referred to as afirst region, a second region, and a third region for simplicity. Thefirst to third regions are divided into regions with similar receivingperformance within the data group. Herein, depending upon thecharacteristic of each region, the type of enhanced data being inputtedto each region may differ.

An example of dividing the data configuration into first to thirdregions based upon a degree of interference of the main data will now bedescribed in detail. Herein, the data group is divided into a pluralityof different regions so that each region can be used for differentpurposes. More specifically, a region having less or no interferencefrom the main data may provide a more enhanced (or powerful) receivingperformance as compared to a region having relatively more interferencefrom the main data. Furthermore, when using a system inserting andtransmitting known data into the data group, and when a long known datasequence is to be consecutively inserted into the enhanced data, a knowndata sequence having a predetermined length may be consecutivelyinserted into a region with no interference from the main data (e.g.,the first region). Conversely, in case of the regions havinginterference from the main data, it is difficult to consecutively insertlong known data sequences into the corresponding regions due to theinterference from the main data. In the description of the presentinvention, the size of the data group, the number of hierarchicallydivided regions within the data group, the size of each hierarchicallydivided region, the number of enhanced data bytes that nay be insertedinto each of the hierarchically divided regions correspond to anexemplary embodiment of the present invention.

At this point, the group formatter 105 configures the data group so thatthe data group includes places (or positions) in which fieldsynchronization signals are to be inserted. Therefore, the data groupmay be configured as described below. More specifically, the firstregion 211 corresponds to a region in which a long known data sequencemay be consecutively inserted into the data group. Herein, the firstregion 211 includes a region that is not mixed with main data.Additionally, the first region 211 also includes a region locatedbetween a field synchronization region that is to be inserted in thedata group and a region in which the first known data sequence is to beinserted. Herein, the field synchronization region has the length of onesegment (i.e., 832 symbols). As described above, if the first region 211corresponds to a region having a known data sequence included in bothend portions, the receiving system uses the channel information that maybe obtained from the known data or the field synchronization region inorder to perform equalization, thereby providing a powerful equalizationperformance.

The second region 212 includes a region located within the first 8segments of the field synchronization region within the data group(i.e., a region chronologically located before the first region 211),and a region located within 8 segments after the last known datasequence inserted into the data group (i.e., a region chronologicallylocated after the first region 211). In case of the second region 212,the receiving system may use the channel information that is obtainedfrom the field synchronization region in order to perform equalization.Alternatively, the receiving system may use the channel information thatmay be obtained from the last known data sequence in order to performequalization, thereby responding to the change in channel.

The third region 213 includes a region including the 9^(th) segment fromthe beginning of the field synchronization region to within 30 upper (orearlier) segments (i.e., a region chronologically located before thefirst region 211), and a region including the 9^(th) segment after thelast known data sequence within the data group to with 44 segments below(or later) (i.e., a region chronologically located after the firstregion 211). At this point, since the third region 213 located earlierthan the first region 211 is located further apart from the fieldsynchronization region, which corresponds to the closest known datasection, the third region 213 may use the channel information that isobtained from the field synchronization region so that the receivingsystem may perform the channel equalization process. Alternatively, thethird region 213 may also use the most recent channel information of aprevious data group. Furthermore, the third region 213 that ischronologically located later than the first region 211 may use thechannel information obtained from the last known data sequence so thatthe receiving system may perform the channel equalization process.However, in this case, when the channel changes at a fast rate, theequalization may not be performed perfectly. Therefore, the equalizationperformance of the third region 213 may be more deteriorated that theequalization performance of the second region 212.

Assuming that the data group is allocated to a plurality ofhierarchically divided regions, as described above, the enhanced datathat are to be inserted into each respective region may be encoded atdifferent coding rates based upon the characteristic of eachhierarchically divided region. Furthermore, the actual amount ofenhanced data that are transmitted may differ (or vary) depending uponthe coding rate of each enhanced data set that is to be inserted intoeach respective region. Therefore, an example of identifying the amountof enhanced data being transmitted by a corresponding code mode will nowbe described in detail. Table 1 below shows an example of the number ofenhanced data bytes that can actually be transmitted from each of thefirst to third regions 211 to 213. Herein, the enhanced data bytes thatcan actually be transmitted correspond to the enhanced data bytes thatare not yet encoded at the coding rate of G/H by the block processor104. Also, in Table 1 below, the numbers marked with a star (*)respectively correspond to the number of data bytes separately allocatedfor transmitting signaling information in the corresponding region.Furthermore, trellis initialization data or known data, MPEG headers,and RS parity data are excluded from the enhanced data. TABLE 1 Codingrate of the block processor Region 1/2 coding rate 1/4 coding rate Firstregion 6480(+36)* 3240(+18)* Second region 1140  570 Third region 20741037

The number of data bytes indicated in Table 1 will be described in moredetail in a later process. An example of code modes for encoding andtransmitting the enhanced data in accordance with such coding ratecombination are shown in Table 2 below. TABLE 2 Coding rate of the blockprocessor Code First Second Third Mode region region region 1 1/2 1/21/2 2 1/2 1/2 1/4 3 1/2 1/4 1/2 4 1/2 1/4 1/4 5 1/4 1/2 1/2 6 1/4 1/21/4 7 1/4 1/4 1/2 8 1/4 1/4 1/4

Table 3 below shows examples of different combination modes of theregions and numbers of available service channels that may beindependently transmitted in the corresponding combination mode. TABLE 3Available Combination Service Mode Combination Channels 1 1^(st) region,2^(nd) region, 3^(rd) region 3 2 1^(st) region + 2^(nd) region, 3^(rd)region 2 3 1^(st) region + 3^(rd) region, 2^(nd) region 2 4 2^(nd)region + 3^(rd) region, 1^(st) region 2 5 1^(st) region + 2^(nd)region + 3^(rd) region 1

Table 3 shows an example of the number of possible combination modes,when a data group is divided into first to third regions. Herein, theamount of enhanced data that can be allocated to each region may varydepending upon a code mode to which the corresponding combination modeis applied. Further, the number of possible combination modes may varydepending upon the number of divided regions of the data group. Morespecifically, as shown in Table 3, when the code mode is ‘1’, first tothird enhanced data (enhanced data 1 to enhanced data 3) each havingdifferent service types are received and, then, processed withrandomizing and RS encoding. Thereafter, each enhanced data set isencoded at the corresponding coding rate, allocated to eachcorresponding region, and then transmitted. At this point, sincedifferent enhanced data types are respectively allocated to eachcorresponding region, the enhanced data set that is to be inserted intoeach region may be encoded by the block processor 104 at an independentcoding rate.

Additionally, as shown in Table 3, when the code mode is ‘2’, first andsecond enhanced data (enhanced data 1 and enhanced data 2) each havingdifferent service types are received and, then, processed withrandomizing and RS encoding. Subsequently, the enhanced data that are tobe inserted into the first and second regions are encoded at a firstcoding rate. And, the enhanced data that are to be inserted into thethird region are encoded at a second coding rate. Thereafter, each ofthe encoded enhanced data sets is allocated to the corresponding regionand, then, transmitted. Herein, the first and second coding rates may beidentical to or different from one another. In the embodiment of thepresent invention, the coding rate corresponds to one of a ½ coding rateand a ¼ coding rate.

Table 4 below shows an example of the combination mode 2, wherein thedata group is divided into first region+second region, and third region.Herein, Table 4 shows the number of enhanced data bytes that can beinserted into the corresponding region depending upon each code mode,when the number of data bytes that can be inserted in each areadepending upon the corresponding coding rate is the same as the numberof data bytes shown in Table 1. TABLE 4 Coding rate of the blockprocessor Combination Mode 2 Code First Second Third First region +Third Mode region region region Second region region 1 1/2 1/2 1/2 76202074 2 1/2 1/2 1/4 7620 1037 3 1/2 1/4 1/2 7050 2074 4 1/2 1/4 1/4 70501037 5 1/4 1/2 1/2 4380 2074 6 1/4 1/2 1/4 4380 1037 7 1/4 1/4 1/2 38102074 8 1/4 1/4 1/4 3810 1037

For example, in case of Combination 2 and Code mode 1, the number ofenhanced data bytes that can be inserted in the first region+secondregion is equal to 7620 bytes, and the data bytes are encoded at thecoding rate of ½. Also, the number of enhanced data bytes that can beinserted in the third region is equal to 2074, wherein the data bytesare also encoded at the coding rate of ½. Furthermore, in case ofCombination 2 and Code mode 3, the number of enhanced data bytes thatcan be inserted in the first region+second region is equal to 7050bytes. Herein, the data bytes corresponding to the first region areencoded at the coding rate of ½, and the data bytes corresponding to thesecond region are encoded at the coding rate of ¼. Also, the number ofenhanced data bytes that can be inserted in the third region is equal to2074, wherein the data bytes are encoded at the coding rate of ½.

Meanwhile, apart from the enhanced data encoded and outputted from theblock processor 104, the group formatter 105 also inserts the MPEGheader place holders, non-systematic RS parity place holders, and maindata place holders with respect to data deinterleaving in a laterprocess, as shown in FIG. 7. Herein, the main data place holders areinserted because of a region in which enhanced data are mixed with maindata, based upon the input of the data deinterleaver shown in FIG. 7.For example, a data place holder for the MPEG header is allocated to thevery beginning of each packet with respect to the output data that havebeen processed with data deinterleaving. Furthermore, the groupformatter 105 inserts known data generated in accordance with apre-decided method or inserts known data place holders for insertingknown data in a later process. The group formatter 105 also insertsplace holders for the initialization of the trellis encoding module(shown in FIG. 3) in the corresponding regions. For example, theinitialization data place holder may be inserted at the beginning of theknown data sequence.

The output of the group formatter 105 is inputted to the datadeinterleaver 106. The data deinterleaver 106 deinterleaves the data anddata place holders within the data group being outputted as an inverseprocess of the data interleaving process. Thereafter, the datadeinterleaver 106 outputs the deinterelaved data and data place holdersto the packet formatter 107. More specifically, when the data and dataplace holders of the data group, which is configured as shown in FIG. 7,are deinterleaved by the data deinterleaver 106, the data group beingoutputted to the packet formatter 107 is configured to have the samestructure as that shown in FIG. 8.

The packet formatter 107 removes the main data place holders and the RSparity place holders that were allocated for the deinterleaving processfrom the deinterleaved data being inputted. Then, the packet formatter107 groups the remaining portion and inserts a MPEG header in the 4-byteMPEG header place holder. Also, when the group formatter 105 insertsknown data place holders, the packet formatter 107 may insert actualknown data in the known data place holders, or may directly output theknown data place holders without any modification in order to makereplacement insertion in a later process. Thereafter, the packetformatter 107 identifies the data within the packet-formatted datagroup, as described above, as a 188-byte unit enhanced data packet(i.e., MPEG TS packet), which is then provided to the packet multiplexer121. The process of pre-processing the enhanced data has been describedwith reference to the pre-processor 100 having the structure shown inFIG. 1.

FIG. 2 illustrates a pre-processor according to another embodiment ofthe present invention. Herein, the pre-processor includes the samenumber of randomizers and RS frame encoders, wherein the numbercorresponds to the type (or number of sets) of enhanced data that are tobe independently processed with separate encoding processes. Suchcharacteristics are identical to those of the pre-processor according tothe first embodiment of the present invention shown in FIG. 1. On theother hand, the difference is that the randomizer for randomizing theenhanced data is positioned (or located) at the outputting end of the RSframe multiplexer in order to perform the randomizing process indisregard of the enhanced data type.

More specifically, the pre-processor 111 shown in FIG. 2 sequentiallyincludes first to third RS frame encoders 111 a to 111 c, a RS framemultiplexer 112, an enhanced data randomizer 113, a block processor 114,a group formatter 115, a data deinterleaver 116, and a packet formatter117. In the present invention having the above-described structure shownin FIG. 2, first to third enhanced data sets are respectively inputtedto the first to third RS frame encoders 111 a to 111 c through eachcorresponding paths. Each of the first to third RS frame encoders 111 ato 111 c groups a plurality of enhanced data bytes that are beinginputted, thereby creating a RS frame, respectively. Then, each RS frameencoder performs an error correction encoding in RS frame units. At thispoint, an error detection encoding process may or may not be performed.Thus, by providing robustness to the enhanced data, the correspondingdata may respond to the severely vulnerable and frequently changingfrequency environment.

Also, each of the first to third RS frame encoders 111 a to 111 c maygroup a plurality of RS frames to create a super frame so as to performinterleaving or permutation in super frame units. Thus, by providingrobustness to the enhanced data, a group error that may occur due to achange in the frequency environment may be scattered, thereby enablingthe corresponding data to respond to the severely vulnerable andfrequently changing frequency environment. The structure and operationsof the first to third RS frame encoders 111 a to 111 c are identical tothose described in FIG. 1, FIG. 4, and FIG. 5. Therefore, detaileddescription of the same will be omitted for simplicity.

The enhanced data being processed with encoding processes in RS frameunits and interleaving processes in super frame units by the first tothird RS frame encoders 111 a to 111 c are then outputted to the RSframe multiplexer 112. The RS frame multiplexer 112 multiplexes theenhanced data being outputted from the first to third RS frame encoders111 a to 111 c in RS frame units. Thereafter, the RS frame multiplexer112 outputs the multiplexed enhanced data to the enhanced datarandomizer 113. The enhanced data randomizer 113 randomizes the enhanceddata that are outputted from the RS frame multiplexer 112 and, then,outputs the randomized enhanced data to the block processor 114. Theoperations of the blocks positioned (or located) after the enhanced datarandomizer 113, i.e., the block processor 114, the group formatter 115,the data deinterleaver 116, and the packet formatter 117, are identicalto those described in FIG. 1. Therefore, detailed descriptions of thesame will be omitted for simplicity.

FIG. 3 illustrates a block diagram of a transmitting system (ortransmitter) including the pre-processors of FIG. 1 or FIG. 2 accordingto the present invention. Referring to FIG. 3, the transmitting systemincludes a pre-processor 100 or 110, a packet multiplexer 121, a datarandomizer 122, a RS encoder/non-systematic RS encoder 123, a datainterleaver 124, a parity replacer 125, a non-systematic RS encoder 126,a trellis encoding module 127, a frame multiplexer 128, and atransmitting unit 130. The enhanced data packet pre-processed by thepre-processor 100 or 110 is inputted to the packet multiplexer 121. Thepacket multiplexer 121 multiplexes the 188-byte unit enhanced datapacket and main data packet outputted from the pre-processor 100 or 110in accordance with a pre-defined multiplexing method. Then, the packetmultiplexer 121 outputs the multiplexed enhanced data packet. Herein,the multiplexing method may be adjusted in accordance with a pluralityof variables related with the system design.

One of the multiplexing methods of the packet multiplexer 121 maycorrespond to identifying enhanced data burst sections and main datasections along a time axis and alternately repeating the two sections.At this point, the enhanced data burst section may transmit at least onedata group, and the main data section may only transmit main data. Theenhanced data burst section may also transmit the main data. When theenhanced data are transmitted in a burst structure, as described above,a digital broadcast receiving system (or receiver) receiving only theenhanced data may turn on the power only during the burst section so asto receive the data. And, during the main data section to which onlymain data are transmitted, the digital broadcast receiving system mayturn the power off so that the main data are not received, therebyreducing power consumption of the receiving system.

When the data being inputted correspond to the main data packet, thedata randomizer 122 performs the same randomizing process of theconventional randomizer. More specifically, the MPEG synchronizationbyte included in the main data packet is discarded and a pseudo randombyte generated from the remaining 187 bytes is used so as to randomizethe data. Thereafter, the randomized data are outputted to the RSencoder/non-systematic RS encoder 123. However, when the inputted datacorrespond to the enhanced data packet, the MPEG synchronization byte ofthe 4-byte MPEG header included in the enhanced data packet isdiscarded, and data randomizing is performed only on the remaining3-byte MPEG header. Randomizing is not performed on the remainingportion of the enhanced data. Instead, the remaining portion of theenhanced data is outputted to the RS encoder/non-systematic RS encoder123. This is because the randomizing process has already been performedon the enhanced data by the randomizer of the pre-processor 100 or 110in an earlier process. Herein, a data randomizing process may or may notbe performed on the known data (or known data place holder) and theinitialization data place holder included in the enhanced data packet.

The RS encoder/non-systematic RS encoder 123 RS-codes the datarandomized by the data randomizer 122 or the data bypassing the datarandomizer 122. Then, the RS encoder/non-systematic RS encoder 123 addsa 20-byte RS parity to the coded data, thereby outputting theRS-parity-added data to the data interleaver 124. At this point, if theinputted data correspond to the main data packet, the RSencoder/non-systematic RS encoder 123 performs a systematic RS-codingprocess identical to that of the conventional broadcasting system on theinputted data, thereby adding the 20-byte RS parity at the end of the187-byte data. Alternatively, if the inputted data correspond to theenhanced data packet, the 20 bytes of RS parity gained by performing thenon-systematic RS-coding are respectively inserted in the decided paritybyte places within the enhanced data packet. Herein, the datainterleaver 124 corresponds to a byte unit convolutional interleaver.The output of the data interleaver 124 is inputted to the parity bytereplacer 125 and the non-systematic RS encoder 126.

Meanwhile, a memory within the trellis encoding module 127, which ispositioned after the parity byte replacer 125, should first beinitialized in order to allow the output data of the trellis encodingmodule 127 so as to become the known data defined based upon anagreement between the receiving system and the transmitting system. Morespecifically, the memory of the trellis encoding module 127 should firstbe initialized before the known data sequence being inputted istrellis-encoded. At this point, the beginning of the known data sequencethat is inputted corresponds to the initialization data place holderinserted by the group formatter of the pre-processor 100 or 110 and notthe actual known data. Therefore, a process of generating initializationdata immediately before the trellis-encoding of the known data sequencebeing inputted and a process of replacing the initialization data placeholder of the corresponding trellis encoding module memory with thenewly generated initialization data are required.

A value of the trellis memory initialization data is decided based uponthe memory status of the trellis encoding module 127, thereby generatingthe trellis memory initialization data accordingly. Due to the influenceof the replace initialization data, a process of recalculating the RSparity, thereby replacing the RS parity outputted from the trellisencoding module 127 with the newly calculated RS parity is required.Accordingly, the non-systematic RS encoder 126 receives the enhanceddata packet including the initialization data place holder that is to bereplaced with the initialization data from the data interleaver 124 andalso receives the initialization data from the trellis encoding module127. Thereafter, among the received enhanced data packet, theinitialization data place holder is replaced with the initializationdata. Subsequently, the RS parity data added to the enhanced data packetare removed. Then, a new non-systematic RS parity is calculated andoutputted to the parity byte replacer 125. Accordingly, the parity bytereplacer 125 selects the output of the data interleaver 124 as the datawithin the enhanced data packet, and selects the output of thenon-systematic RS encoder 126 as the RS parity. Thereafter, the paritybyte replacer 125 outputs the selected data.

Meanwhile, if the main data packet is inputted, or if the enhanced datapacket that does not include the initialization data place holder thatis to be replaced, the parity byte replacer 125 selects the data and RSparity outputted from the data interleaver 124 and directly outputs theselected data to the trellis encoding module 127 without modification.The trellis encoding module 127 converts the byte-unit data tosymbol-unit data and 12-way interleaves and trellis-encodes theconverted data, which are then outputted to the frame multiplexer 128.The frame multiplexer 128 inserts field synchronization and segmentsynchronization signals in the output of the trellis encoding module 127and then outputs the processed data to the transmitting unit 130.Herein, the transmitting unit 130 includes a pilot inserter 131, amodulator 132, and a radio frequency (RF) up-converter 133. Theoperation of the transmitting unit 130 is identical to the conventionaltransmitters. Therefore, a detailed description of the same will beomitted for simplicity.

DETAILED EMBODIMENT

Hereinafter, detailed embodiments of the pre-processor 100 or 110 andthe packet multiplexer 121 will now be described. According to anembodiment of the present invention, the N value corresponding to thelength of a row, which is included in the RS frame that is configured bythe RS frame encoder, is set to be equal to 538. Accordingly, when thestructure of FIG. 4 is applied, the RS frame encoder receives 538transport stream (TS) packets so as to configure a RS frame having thesize of 538*187 bytes. Alternatively, when the structure of FIG. 5 isapplied, the RS frame encoder receives 540 transport stream (TS) packetsso as to configure a RS frame having the size of 540*187 bytes.

More specifically, in case of FIG. 4, the RS frame is processed with a(235,187)-RS encoding process so as to configure another RS frame havingthe size of 538*235 bytes. The RS frame is then processed withgenerating a 16-bit checksum so as to be expanded to a RS frame havingthe size of 540*235. Alternatively, in case of FIG. 5, the RS framehaving the size of 540*187 is processed with a (235,187)-RS encodingprocess so as to be expanded to a RS frame having the size of 540*235.

Meanwhile, referring to Table 2 and Table 3, it is assumed that theenhanced data are encoded, grouped, and transmitted in accordance withthe code mode 3 and the combination mode 2. Referring to Table 2, incase of the code mode 3, the first region and the third region areencoded at the ½ coding rate, and the second region is encoded at the ¼coding rate. Also, referring to Table 3, in case of the combination mode2, the data group is divided into the first region+second region, and athird region. Herein, the enhanced data being inserted in the firstregion+second region correspond to the same service type. Alternatively,the enhanced data being inserted in the third region correspond to adifferent service type. These examples are merely exemplary and do notlimit the scope of the present invention.

In the above described example, referring to Table 1 to Table 4, 7050bytes are transmitted to the first region+second region, and 2074 bytesare transmitted to the third region. At this point, it is assumed thatone super frame is configured of 2 RS frame, and that 18 data groups aregrouped to form a RS frame. Herein, when it is also assumed that theenhanced data of the 2 RS frames configuring the super frame areinserted into the first region+second region, the super frame isconfigured of 253800 bytes, and the RS frame is configured of 126900bytes. Herein, the number of RS parity bytes P is set to be equal to 48(i.e., P=48), and 2 CRC checksums are set to be included for each row.Accordingly, in one super frame, a total of 1076 188-byte enhanced datapackets may be transmitted. This indicates that 538 enhanced datapackets may be transmitted for one RS frame.

Similarly, 2074 bytes are transmitted to the third region. At thispoint, when it is assumed that 18 data groups are grouped to form a RSframe, and that the enhanced data of the RS frame are inserted into thethird region, the RS frame is configured of 37332 bytes. Herein, thenumber of RS parity bytes P is set to be equal to 36 (i.e., P=36), and 2CRC checksums are set to be included for each row. Accordingly, when onesuper frame is configured of 2 RS frames, a total of 330 188-byteenhanced data packets may be transmitted for each super frame. In thiscase, 91 bytes may remain for each RS frame of the third region withinthe data group. Remaining data bytes may occur, when dividing each RSframe into a plurality of data groups having the same size. Morespecifically, remaining data bytes may occur in particular regions ineach RS frame depending upon the size of the RS frames, the size andnumber of divided data groups, the number of enhanced data bytes thatmay be inserted into each data group, the coding rate of thecorresponding region, the number of RS parity bytes, whether or not aCRC checksum has been allocated, and, if any, the number of CRCchecksums allocated.

When dividing the RS frame into a plurality of data groups having thesame size, and when remaining data bytes occur in the corresponding RSframe, K number of dummy bytes are added to the corresponding RS frame,wherein K is equal to the number of remaining data bytes within the RSframe. Then, the dummy byte-added RS frame is divided into a pluralityof data groups. This process is illustrated in FIG. 9. Morespecifically, FIG. 9 illustrates an example of processing K number ofremaining data bytes, which are produced by dividing the RS frame havingthe size of (N+2)*(187+P) bytes into M number of data groups havingequal sizes. In this case, as shown in FIG. 9(a), K number of dummybytes are added to the RS frame having the size of (N+2)*(187+P) bytes.Subsequently, the RS frame is read in row units, thereby being dividedinto M number of data groups, as shown in FIG. 9(b). At this point, eachdata group has the size of NoBytesPerGrp bytes.

This may be described by Equation 3 shown below.M×NoBytesPerGrp=(N+2)×(187+P)×K  Equation 3

Herein, NoBytesPerGrp indicates the number of bytes allocated for eachgroup (i.e., the Number of Bytes Per Group). More specifically, the sizecorresponding to the number of byte in one RS frame+K bytes is equal tothe size of the M number of data groups.

When transmitting the enhanced data by using the above-described methodand mode, the pre-processors shown in FIG. 1 and FIG. 2 may receive 1076packets through a first enhanced data path and 330 packets through asecond enhanced data path. Referring to FIG. 1, the 1076 packetsinputted through the first enhanced data path and the 330 packetsinputted through the second enhanced data path are respectivelyrandomized by the first and second enhanced data randomizers 101 a and101 b. Thereafter, an encoding process in RS frame units and aninterleaving process in super frame units are each performed on therandomized data packets by the first and second RS frame encoders 102 aand 102 b. Subsequently, the processed packets are divided into RS frameunits, thereby inputted to the block processor 104 through the RS framemultiplexer 103.

In the embodiment of the present invention, 48 parity bytes are added ina column direction for each corresponding RS frame by the first RS frameencoder 102 a, and 2 CRC checksums are added to the corresponding RSframe in a row direction. Also, 36 parity bytes are added in a columndirection for each corresponding RS frame by the second RS frame encoder102 b, and 2 CRC checksums are added to the corresponding RS frame in arow direction. Thereafter, the block processor 104 receives the enhanceddata that are divided into byte units allocated to one data group, whichare then encoded and interleaved. At this point, as described above, 91data bytes remain for each RS frame in the third region within the datagroup. Therefore, when all data bytes that are to be allocated to thethird region are inputted, 91 dummy bytes are also added (or inputted)to the third region. Herein, the dummy bytes may be added by the blockprocessor 104 or inputted by an external block (not shown).

The block processor 104 encoded each of the data bytes at a ½ codingrate or a ¼ coding rate based upon the region to which the data bytesare to be allocated. Afterwards, the block processor 104 outputs theencoded data bytes to the group formatter 105. For example, the firstenhanced data that are to be inserted into the first region are encodedat a ½ coding rate, the first enhanced data that are to be inserted intothe second region are encoded at a ¼ coding rate, and the secondenhanced data that are to be inserted into the third region are encodedat a ½ coding rate. The group formatter 105 receives the encodedenhanced data and other types of data (e.g., MPEG header place holders,non-systematic RS parity place holders, main data place holders, knowndata or known data place holders, initialization data place holders,etc.) and inserts (or allocates) the received data to the correspondingregion within the data group shown in FIG. 7. More specifically, the½-rate encoded first enhanced data and the ¼-rate encoded first enhanceddata are inserted into the first region+second region, and the ½-rateencoded second enhanced data are inserted to the third region.

The data bytes within the data group configured as shown in FIG. 7 aredeinterleaved by the data deinterleaver 106 and converted as shown inFIG. 8. Subsequently, the converted data are converted to 187-byteenhanced data packets (i.e., MPEG-2 transport packets) by the packetformatter 107, which are then outputted to the packet multiplexer 121.The packet multiplexer 121 multiplexes the packet including the enhanceddata and the packet including the main data into burst units, which arethen outputted to the randomizer 122.

FIG. 10 illustrates detailed exemplary operations of the packetmultiplexer 121 according to the embodiment of the present invention.Particularly, FIG. 10 illustrates an example of transmitting data inburst units. More specifically, the packet multiplexer 121 configuresone burst section (or BP section) with BP number of fields. In otherwords, the BP section includes the number of fields from the beginningof the current burst to the beginning of the next burst.

The BP section is then configured of BS number of fields and BP-BSnumber of fields. The section configured of BP number of fields (or BSsection) includes data fields having enhanced data groups and main datamixed therein, and the section configured of BP-BS number of fields (orBP-BS section) includes fields configured only of the main data. Eachfield of the BS section is configured of a field synchronization segmentand 312 data segments. Herein, a data group and main data aremultiplexed in the 312 data segments. Referring to FIG. 10, in the BSsection, the data within the data group are allocated to 118 segments,and the main data are allocated to 195 segments, thereby configuring afield.

Also, referring to FIG. 10, each field within the BS section includes adata group index. Herein, GI indicates an order of data group currentlybeing transmitted within one burst section. Also, a TNB section includesa number of fields starting from a current data group (GI) within aburst section to a starting point of the next burst section. The TNBvalue may be updated in accordance with the GI index of the data groupthat is currently being transmitted. Herein, the number of fieldsincluded in the TNB section may be obtained based upon the number offields included in the BP section and the CI index of the data groupcurrently being transmitted. Furthermore, the power-on period of thenext burst may be estimated by subtracting GI from BP (i.e., BP-GI), orestimated by the TNB value.

In the above-described example, one RS frame is divided into 18 datagroups and then transmitted. Therefore, referring to FIG. 10, the BSsection is configured of 18 fields, and one super frame is divided into36 data groups (i.e., 2 RS frames) and then transmitted. Accordingly,the digital broadcast receiving system may turn the power on only duringthe corresponding burst section including the desired data service, soas to receive the corresponding data. And, by turning the power offduring the remaining sections, excessive power consumption of thereceiving system may be reduced. Furthermore, by turning the power onduring the 18 data fields included in the data group, and by turning thepower off during the (BP-18) data fields, excessive power consumptionmay be controlled without influencing the receiving performance of thedigital broadcast signals. The digital broadcast receiving systemaccording to the present invention is advantageous in that one RS framemay be configured by the 18 data groups received in one burst section,thereby facilitating the decoding process.

Signaling Information

As described above, in order to enable the receiving system to properlyand adequately process the enhanced data, the receiving system should beaccurately aware of the transmission parameters used by the transmittingsystem. Examples of such parameters essentially required by theabove-described pre-processor include the number of RS framesconfiguring a super frame (i.e., a super frame size (SFS)), the numberof RS parity data bytes (P) for each column within the RS frame, whetheror not a checksum, which is added to determine the presence of an errorin a row direction within the RS frame, has been used, the type and sizeof the checksum if the checksum is used (presently, 2 data bytes areadded to the CRC), the number of data groups configuring one RSframe—since the RS frame is transmitted to one burst section, the numberof data groups configuring the one RS frame is identical to the numberof data groups within one burst (i.e., burst size (BS)), and variouscode modes shown in Table 2 and Table 3.

Also, the parameters required for receiving a burst includes a burstperiod—herein, one burst period corresponds to a value obtained bycounting the number of fields starting from the beginning of a currentburst until the beginning of a next burst, a positioning order of the RSframes that are currently being transmitted within a super frame (i.e.,a permuted frame index (PFI)) or a positioning order of groups that arecurrently being transmitted within a RS frame (burst) (i.e., a groupindex (GI)), and a burst size. Depending upon the method of managing aburst, the transmission parameter also includes the number of fieldsremaining until the beginning of the next burst (i.e., time to nextburst (TNB)). And, by transmitting such information as the transmissionparameter, each data group being transmitted to the receiving system mayindicate a relative distance (or number of fields) between a currentposition and the beginning of a next burst.

In the embodiment of the present invention, a parameter is transmittedby grouping parameters to create small-sized block codes using Kerdockcodes, and BCH or RS codes, which are added to a data byte allocated forsignaling within the data group (as shown in FIG. 1). However, in thiscase, the parameter value is obtained by passing through the blockdecoder from the receiving end. Therefore, mode parameters of Table 2and Table 3 that are required for the block decoding process shouldfirst be obtained. For this reason, the mode parameter inserts aparameter in a portion of an unused (or reserved) section of the knowndata. More specifically, this corresponds to a method of using acorrelation of symbols for a faster decoding process. In other words,one of 8 sequences having excellent orthogonality (e.g., 8 differentmodes shown in Table 2) is matched with the current mode and inserted inthe corresponding section of each data group. The receiving system thendetermines the code mode and combination mode based upon the correlationbetween each of the sequences and the sequence currently being received.

For example, a transmission parameter may be allocated and inserted to apredetermined region of an enhanced data packet or an enhanced datagroup. In this case, the transmission parameter is treated and processedas enhanced data. In addition, the transmission parameter may bemultiplexed with other data and then inserted. For example, whenmultiplexing the known data and the enhanced data, the transmissionparameter may be inserted instead of the known data in a place (orposition) where known data is to be inserted. Alternatively, thetransmission parameter may be mixed with the known data and theninserted. Furthermore, the transmission parameter may be allocated andinserted to a portion of a reserved region within the fieldsynchronization segment of a transmission frame. Meanwhile, when thetransmission parameter is inserted in the field synchronization segmentregion or the known data region and then transmitted, the reliability ofthe transmission parameter is reduced when the transmission parameterpasses through the transmission channel. Therefore, a method ofinserting one of a plurality of pre-defined patterns based upon thetransmission parameter may also be used. At this point, the receivingsystem may recognize and acknowledge the transmission parameter byperforming a correlation calculation between the received signal and thepre-defined patterns.

Receiving System

FIG. 11 illustrates a block diagram of a demodulating unit included inthe receiving system according to an embodiment of the presentinvention. Herein, the demodulating unit of FIG. 11 may use known datainformation being inserted in an enhanced data section and transmittedfrom the transmitting system so as to perform processes, such as carriersynchronization recovery, frame synchronization recovery, and channelequalization, thereby enhancing the receiving performance. In order todo so, the demodulating unit according to the present invention includesa demodulator 301, a channel equalizer 302, a known sequence detector303, a block decoder 304, an enhanced data processing unit 305, and amain data processing unit 306. Herein, the main data processing unit 306includes a data deinterleaver 307, a RS decoder 308, and a main dataderandomizer 309. The enhanced data processing unit 305 may have aplurality of structures depending upon the configuration of thepre-processor included in the transmitting system.

FIG. 12 and FIG. 13 illustrate detailed block diagrams of the enhanceddata processing unit 305. The enhanced data processing unit 305 of FIG.12 is more efficient when the pre-processor of the transmitting systemshown in FIG. 1 is applied thereto. Alternatively, the enhanced dataprocessing unit 305 of FIG. 13 is more efficient when the pre-processorof the transmitting system shown in FIG. 2 is applied thereto. Morespecifically, an IF signal of a particular channel is tuned by a tuner.Then, the tuned IF signal is inputted to the demodulator 301 and theknown sequence detector 303. The demodulator 301 performs automatic gaincontrol, carrier recovery, and timing recovery on the IF signal that isbeing inputted, thereby creating baseband data, which are then outputtedto the equalizer 302 and the known sequence detector 303. The equalizer302 compensates the distortion within the channel included in thedemodulated signal. Then, the equalizer 302 outputs the compensated datato the block decoder 304.

At this point, the known sequence detector 303 detects the known dataplace inserted by the transmitting system to the input/output data ofthe demodulator 301 (i.e., data prior to demodulation or data afterdemodulation). Then, along with the position information, the knownsequence detector 303 outputs the symbol sequence of the known datagenerated from the corresponding position to the demodulator 301 and theequalizer 302. Additionally, the known sequence detector 303 outputsinformation enabling the block decoder 304 to identify the enhanced databeing additionally encoded by the transmitting system and the main datathat are not additionally encoded to the block decoder 304. Furthermore,although the connection is not shown in FIG. 11, the informationdetected by the known sequence detector 303 may be used in the overallreceiving system and may also be used in the enhanced data processingunit 305.

By using the known data symbol sequence when performing the timingrecovery or carrier recovery, the demodulating performance of thedemodulator 301 may be enhanced. Similarly, by using the known data, thechannel equalizing performance of the channel equalizer 302 may beenhanced. Furthermore, by feeding-back the demodulation result of theblock demodulator 304, the channel equalizing performance may also beenhanced. Herein, the channel equalizer 302 may perform channelequalization through various methods. In the present invention, a methodof estimating a channel impulse response (CIR) for performing thechannel equalization process will be given as an example of the presentinvention. More specifically, in the present invention, the channelimpulse response (CIR) is differently estimated and applied inaccordance with each hierarchical region within the data group that aretransmitted from the transmitting system. Furthermore, by using theknown data having the position (or place) and contents pre-knownaccording to an agreement between the transmitting system and thereceiving system, so as to estimate the CIR, the channel equalizationprocess may be processed with more stability.

In the present invention, one data group that is inputted for channelequalization is divided into first to third regions, as shown in FIG. 7.As described above, the present invention uses the CIR estimated fromthe field synchronization data and the known data sequences in order toperform channel equalization on data within the data group. At thispoint, each of the estimated CIRs may be directly used in accordancewith the characteristics of each region within the data group.Alternatively, a plurality of the estimated CIRs may also be eitherinterpolated or extrapolated so as to create a new CIR, which is thenused for the channel equalization process.

Herein, when a value F(A) of a function F(x) at a particular point A anda value F(B) of the function F(x) at another particular point B areknown, interpolation refers to estimating a function value of a pointwithin the section between points A and B. Linear interpolationcorresponds to the simplest form among a wide range of interpolationoperations. The linear interpolation described herein is merelyexemplary among a wide range of possible interpolation methods. And,therefore, the present invention is not limited only to the examples setforth herein.

Alternatively, when a value F(A) of a function F(x) at a particularpoint A and a value F(B) of the function F(x) at another particularpoint B are known, extrapolation refers to estimating a function valueof a point outside of the section between points A and B. Linearextrapolation is the simplest form among a wide range of extrapolationoperations. Similarly, the linear extrapolation described herein ismerely exemplary among a wide range of possible extrapolation methods.And, therefore, the present invention is not limited only to theexamples set forth herein.

Meanwhile, if the data being inputted to the block decoder 304 afterbeing channel equalized from the equalizer 302 correspond to theenhanced data having additional encoding and trellis encoding processesperformed thereon by the transmitting system, trellis decoding andadditional decoding processes are performed on the inputted data asinverse processes of the transmitting system. Alternatively, if the databeing inputted to the block decoder 304 correspond to the main datahaving only a trellis encoding process performed thereon, and not theadditional encoding process, only the trellis decoding process isperformed on the inputted data as the inverse process of thetransmitting system. The data group decoded by the block decoder 304 isinputted to the enhanced data processing unit 305, and the main datapacket is inputted to the data deinterleaver 307 of the main dataprocessing unit 306.

More specifically, if the inputted data correspond to the main data, theblock decoder 304 performs Viterbi decoding on the inputted data so asto output a hard decision value or to perform a hard-decision on a softdecision value, thereby outputting the result. Meanwhile, if theinputted data correspond to the enhanced data, the block decoder 304outputs a hard decision value or a soft decision value with respect tothe inputted enhanced data. In other words, if the inputted datacorrespond to the enhanced data, the block decoder 304 performs adecoding process on the data encoded by the block processor and trellisencoding module of the transmitting system.

At this point, the RS frame encoder of the pre-processor included in thetransmitting system may be viewed as an external code. And, the blockprocessor and the trellis encoder may be viewed as an internal code. Inorder to maximize the performance of the external code when decodingsuch concatenated codes, the decoder of the internal code should outputa soft decision value. Therefore, the block decoder 304 may output ahard decision value on the enhanced data. However, when required, it maybe more preferable for the block decoder 304 to output a soft decisionvalue.

Meanwhile, the data deinterleaver 307, the RS decoder 308, and the maindata derandomizer 309 of the main data processing unit 306 are blocksrequired for receiving the main data. Therefore, the above-mentionedblocks may not be required in the structure of a digital broadcastreceiving system that only receives the enhanced data. The datadeinterleaver 307 performs an inverse process of the data interleaverincluded in the transmitting system. In other words, the datadeinterleaver 307 deinterleaves the main data outputted from the blockdecoder 304 and outputs the deinterleaved main data to the RS decoder308. The RS decoder 308 performs a systematic RS decoding process on thedeinterleaved data and outputs the processed data to the main dataderandomizer 309. The main data derandomizer 309 receives the output ofthe RS decoder 308 and generates a pseudo random data byte identical tothat of the randomizer included in the digital broadcast transmittingsystem. Thereafter, the main data derandomizer 309 performs a bitwiseexclusive OR (XOR) operation on the generated pseudo random data byte,thereby inserting the MPEG synchronization bytes to the beginning ofeach packet so as to output the data in 188-byte main data packet units.

Hereinafter, the enhanced data processing unit 305 will now be describedin detail with reference to FIG. 12 and FIG. 13. The enhanced dataprocessing unit of FIG. 12 includes a data deformatter 411, a RS framedemultiplexer 412, a plurality of RS frame decoders 413 a to 413 c, anda plurality of enhanced data derandomizers 414 a to 414 c. The number ofRS frame decoders and the number of derandomizers included in FIG. 12are merely exemplary and may vary depending upon the structure of thetransmitting system, the types of enhanced data available for service,and the degree of importance of the available enhanced data. Therefore,the present invention is not limited to the numbers presented in thefollowing description.

Referring to FIG. 12, the data being outputted from the block decoder304 to the data deformatter 411 of the enhanced data processing unit 305are outputted in the form of a data group. At this point, the datadeformatter 411 is already aware of the configuration of the input datagroup. Therefore, the signaling information having system informationincluded therein and the enhanced data are identified in the data group.The identified signaling information is transmitted to a place relatedwith the system information, and the enhanced data are outputted to theRS frame demultiplexer 412. The RS frame demultiplexer 412 identifiesthe enhanced data based upon the service type transmitted from thetransmitting system. Thereafter, the RS frame demultiplexer 412respectively outputs the identified enhanced data sets to each RS framedecoder 413 a to 413 c.

At this point, the data deformatter 411 removes the known data, trellisinitialization data, and MPEG header bytes that were inserted in themain data and the data group, and also removed the RS parity bytes thatwere added by the RS encoder/non-systematic RS encoder of thetransmitting system. Thereafter, the data deformatter 411 outputs theprocessed data to the RS frame demultiplexer 412. Therefore, the firstto third RS frame decoders 413 a to 413 c each receives only theenhanced data that are RS-encoded and CRC-encoded in RS frame units andthat are interleaved in super frame units.

The first to third RS frame decoders 413 a to 413 c performs inverseprocesses of the corresponding RS frame encoders included in thetransmitting system, so as to correct the errors within the RS frame.Then, the 1 MPEG synchronization data byte, which was removed during theRS frame encoding process, is added to the error-corrected enhanced datapacket. Thereafter, the processed data are respectively outputted toeach of the first to third enhanced data derandomizers 414 a to 414 c.The operations of each RS frame decoder will be described in detail in alater process. The first to third enhanced data derandomizers 414 a to414 c respectively perform derandomizing processes, each correspondingto the inverse process of the randomizers included in the transmittingsystem, on the received enhanced data. Then, by outputting thederandomized enhanced data, the enhanced data initially outputted fromthe transmitting system may be obtained. For example, assuming that thefirst to third enhanced data derandomizers 414 a to 414 c are allincluded in the structure of the present invention, and that each of thefirst to third enhanced data derandomizers 414 a to 414 c isoperational, three different types of enhanced data services may beavailable.

FIG. 13 illustrates an enhanced data processing unit according toanother embodiment of the present invention. The difference between theenhanced data processing unit shown in FIG. 13 and that shown in FIG. 12is the position (or location) of the derandomizer. More specifically,the derandomizer of the receiving system performs the inverse process ofthe randomizer of the transmitting system. Therefore, depending upon theposition of the randomizer in the transmitting system shown in FIG. 1and FIG. 2, the derandomizer of the receiving system may be positionedbehind the RS frame demultiplexer, as shown in FIG. 12, or positionedbefore the RS frame multiplexer, as shown in FIG. 13.

The enhanced data processing unit of FIG. 13 includes a data deformatter511, an enhanced data derandomizer 512, a RS frame demultiplexer 513,and a plurality of RS frame decoders 514 a to 514 c. The number of RSframe decoders included in FIG. 13 are merely exemplary and may varydepending upon the structure of the transmitting system, the types ofenhanced data available for service, and the degree of importance of theavailable enhanced data. Therefore, the present invention is not limitedto the numbers presented in the following description. The structure andoperations of the data deformatter 511 is identical to those of the datadeformatter 411 shown in FIG. 12. Therefore, a detailed description ofthe same will be omitted for simplicity.

Referring to FIG. 13, the enhanced data derandomizer 512 is positionedbefore the RS frame decoders 514 a to 514 c. As a result, whenperforming the derandomizing process, a soft decision is required to bemade by the RS frame decoders 514 a to 514 c in a later process.Accordingly, when the block decoder 304 receives the soft decisionvalue, it is difficult to perform a bitwise exclusive OR (XOR) operationbetween the soft decision value of the enhanced data and the pseudorandom bit in order to perform the derandomizing process. Then, when anXOR operation is performed between the pseudo random bit and the softdecision value, if the pseudo random bit is equal to ‘1’, the code ofthe soft decision value is inversed (or changed) and outputted. And, ifthe pseudo random bit is equal to ‘0’, the code of the soft decisionvalue is directly outputted without any modification, therebymaintaining the soft decision status, which is then transmitted to thecorresponding RS frame decoder.

As described above, if the pseudo random bit is equal to ‘1’, the codeof the soft decision value is changed because, when an XOR operation isperformed between the pseudo random bit and the input data in therandomizer of the transmitting system, and when the pseudo random bit isequal to ‘1’, the code of the output data bit becomes the inverse of theinput data (i.e., 0 XOR 1=1 and 1 XOR 1=0). More specifically, if thepseudo random bit generated from the enhanced data derandomizer 512 isequal to ‘1’, and when an XOR operation is performed on the harddecision value of the enhanced data bit, the XOR-operated value becomesthe opposite value of the hard decision value. Therefore, when the softdecision value is outputted, a code inversed from (or opposite to) thatof the soft decision value is outputted. Hereinafter, the operations ofone of the RS frame decoders shown in FIG. 12 and FIG. 13 will now bedescribed in detail with reference to FIG. 14.

FIG. 14 illustrates a process of grouping a plurality of data groups(e.g., 18 data groups) to create a RS frame and a RS frame reliabilitymap, and also a process of performing data deinterleaving in super frameunits as an inverse process of the transmitting system and identifyingthe deinterleaved RS frame and RS frame reliability map. Morespecifically, the RS frame decoder groups the inputted enhanced data soas to create a RS frame. The enhanced data have been RS-encoded RS frameunits by the transmitting system, and then interleaved in super frameunits. At this point, the error correction encoding process (e.g., theCRC encoding process) may have been performed on the enhanced data (asshown in FIG. 4), or may not have been performed on the enhanced data(as shown in FIG. 5).

If it is assumed that the transmitting system has divided the RS framehaving the size of (N+2)*(187+P) bytes into M number of data groups(wherein, for example, M is equal to 18) and then transmitted thedivided RS frame, the receiving system groups the enhanced data of eachdata group, as shown in FIG. 14(a), so as to create a RS frame havingthe size of (N+2)*(187+P) bytes. At this point, if a dummy byte has beenadded to at least one of the data groups configuring the correspondingRS frame and, then, transmitted, the dummy byte is removed, and a RSframe and a RS frame reliability map are created. For example, as shownin FIG. 9, if K number of dummy bytes has been added, the RS frame andRS frame reliability map are created after the K number of dummy byteshas been removed.

Furthermore, if it is assumed that the RS frame is divided into 18 datagroups, which are then transmitted from a single burst section, thereceiving system also groups enhanced data of 18 data groups within thecorresponding burst section, thereby creating the RS frame. Herein, whenit is assumed that the block decoder 304 outputs a soft decision valuefor the decoding result, the RS frame decoder may decide the ‘0’ and ‘1’of the corresponding bit by using the codes of the soft decision value.8 bits that are each decided as described above are grouped to createone data byte. If the above-described process is performed on all softdecision values of the 18 data groups included in a single burst, the RSframe having the size of (N+2)*(187+P) bytes may be configured.Additionally, the present invention uses the soft decision value notonly to configure the RS frame but also to configure a reliability map.Herein, the reliability map indicates the reliability of thecorresponding data byte, which is configured by grouping 8 bits, the 8bits being decided by the codes of the soft decision value.

For example, when the absolute value of the soft decision value exceedsa pre-determined threshold value, the value of the corresponding bit,which is decided by the code of the corresponding soft decision value,is determined to be reliable. Conversely, when the absolute value of thesoft decision value does not exceed the pre-determined threshold value,the value of the corresponding bit is determined to be unreliable.Thereafter, if even a single bit among the 8 bits, which are decided bythe codes of the soft decision value and group to configure one databyte, is determined to be unreliable, the corresponding data byte ismarked on the reliability map as an unreliable data byte.

Herein, determining the reliability of one data byte is only exemplary.More specifically, when a plurality of data bytes (e.g., at least 4 databytes) are determined to be unreliable, the corresponding data bytes mayalso be marked as unreliable data bytes within the reliability map.Conversely, when all of the data bits within the one data byte aredetermined to be reliable (i.e., when the absolute value of the softdecision values of all 8 bits included in the one data byte exceed thepredetermined threshold value), the corresponding data byte is marked tobe a reliable data byte on the reliability map. Similarly, when aplurality of data bytes (e.g., at least 4 data bytes) are determined tobe reliable, the corresponding data bytes may also be marked as reliabledata bytes within the reliability map. The numbers proposed in theabove-described example are merely exemplary and, therefore, do notlimit the scope or spirit of the present invention.

The process of configuring the RS frame and the process of configuringthe reliability map both using the soft decision value may be performedat the same time. Herein, the reliability information within thereliability map is in a one-to-one correspondence with each byte withinthe RS frame. For example, if a RS frame has the size of (N+2)*(187+P)bytes, the reliability map is also configured to have the size of(N+2)*(187+P) bytes. FIG. 14(a′) and FIG. 14(b′) respectively illustratethe process steps of configuring the reliability map according to thepresent invention.

At this point, the RS frame of FIG. 14(b) and the RS frame reliabilitymap of FIG. 14(b′) are interleaved in super frame units (as shown inFIG. 6). Therefore, the RS frame and the RS frame reliability maps aregrouped to create a super frame and a super frame reliability map.Subsequently, as shown in FIG. 14(c) and FIG. 14(c′), a deinterleavingprocess is performed in super frame units on the RS frame and the RSframe reliability maps, as an inverse process of the transmittingsystem. Then, when the deinterleaving process is performed in superframe units, the processed data are divided into deinterleaved RS frameshaving the size of (N+2)*(187+P) bytes and deinterleaved RS framereliability maps having the size of (N+2)*(187+P) bytes, as shown inFIG. 14(d) and FIG. 14(d′). Subsequently, the RS frame reliability mapis used on the deinterleaved RS frames so as to perform errorcorrection.

FIG. 15 and FIG. 16 illustrate example of the error correction processedaccording to embodiments of the present invention. FIG. 15 illustratesan example of performing an error correction process when thetransmitting system has performed both RS encoding and CRC encodingprocesses on the RS frame (as shown in FIG. 4). And, FIG. 16 illustratesan example of performing an error correction process when thetransmitting system has performed only the RS encoding process and notthe CRC encoding process on the RS frame (as shown in FIG. 5).Hereinafter, the error correction process will now be described indetail with reference to FIG. 15.

As shown in FIG. 15(a) and FIG. 15(a′), when the RS frame having thesize of (N+2)*(187+P) bytes and the RS frame reliability map having thesize of (N+2)*(187+P) bytes are created, a CRC syndrome checking processis performed on the created RS frame, thereby verifying whether anyerror has occurred in each row. Subsequently, as shown in FIG. 15(b), a2-byte checksum is removed to configure an RS frame having the size ofN*(187+P) bytes. Herein, the presence (or existence) of an error isindicated on an error flag corresponding to each row. Similarly, sincethe portion of the reliability map corresponding to the CRC checksum hashardly any applicability, this portion is removed so that only N*(187+P)number of the reliability information bytes remain, as shown in FIG.15(b′).

After performing the CRC syndrome checking process, as described above,a RS decoding process is performed in a column direction. Herein, a RSerasure correction process may be performed in accordance with thenumber of CRC error flags. More specifically, as shown in FIG. 15(c),the CRC error flag corresponding to each row within the RS frame isverified. Thereafter, the RS frame decoder 606 determines whether thenumber of rows having a CRC error occurring therein is equal to orsmaller than the maximum number of errors on which the RS erasurecorrection may be performed, when performing the RS decoding process ina column direction. The maximum number of errors corresponds to P numberof parity bytes inserted when performing the RS encoding process. In theembodiment of the present invention, it is assumed that 48 parity byteshave been added to each column (i.e., P=48).

If the number of rows having the CRC errors occurring therein is smallerthan or equal to the maximum number of errors (i.e., 48 errors accordingto this embodiment) that can be corrected by the RS erasure decodingprocess, a (235,187)-RS erasure decoding process is performed in acolumn direction on the RS frame having (187+P) number of N-byte rows(i.e., 235 N-byte rows), as shown in FIG. 15(d). Thereafter, as shown inFIG. 15(e), the 48-byte parity data that have been added at the end ofeach column are removed. Conversely, however, if the number of rowshaving the CRC errors occurring therein is greater than the maximumnumber of errors (i.e., 48 errors) that can be corrected by the RSerasure decoding process, the RS erasure decoding process cannot beperformed. In this case, the error may be corrected by performing ageneral RS decoding process. In addition, the reliability map, which hasbeen created based upon the soft decision value along with the RS frame,may be used to further enhance the error correction ability (orperformance) of the present invention.

More specifically, the RS frame decoder compares the absolute value ofthe soft decision value of the block decoder 304 with the pre-determinedthreshold value, so as to determine the reliability of the bit valuedecided by the code of the corresponding soft decision value. Also, 8bits, each being determined by the code of the soft decision value, aregrouped to form one data byte. Accordingly, the reliability informationon this one data byte is indicated on the reliability map. Therefore, asshown in FIG. 15(c), even though a particular row is determined to havean error occurring therein based upon a CRC syndrome checking process onthe particular row, the present invention does not assume that all bytesincluded in the row have errors occurring therein. The present inventionrefers to the reliability information of the reliability map and setsonly the bytes that have been determined to be unreliable as erroneousbytes. In other words, with disregard to whether or not a CRC errorexists within the corresponding row, only the bytes that are determinedto be unreliable based upon the reliability map are set as erasurepoints.

According to another method, when it is determined that CRC errors areincluded in the corresponding row, based upon the result of the CRCsyndrome checking result, only the bytes that are determined by thereliability map to be unreliable are set as errors. More specifically,only the bytes corresponding to the row that is determined to haveerrors included therein and being determined to be unreliable based uponthe reliability information, are set as the erasure points. Thereafter,if the number of error points for each column is smaller than or equalto the maximum number of errors (i.e., 48 errors) that can be correctedby the RS erasure decoding process, an RS erasure decoding process isperformed on the corresponding column. Conversely, if the number oferror points for each column is greater than the maximum number oferrors (i.e., 48 errors) that can be corrected by the RS erasuredecoding process, a general decoding process is performed on thecorresponding column.

More specifically, if the number of rows having CRC errors includedtherein is greater than the maximum number of errors (i.e., 48 errors)that can be corrected by the RS erasure decoding process, either an RSerasure decoding process or a general RS decoding process is performedon a column that is decided based upon the reliability information ofthe reliability map, in accordance with the number of erasure pointswithin the corresponding column. For example, it is assumed that thenumber of rows having CRC errors included therein within the RS frame isgreater than 48. And, it is also assumed that the number of erasurepoints decided based upon the reliability information of the reliabilitymap is indicated as 40 erasure points in the first column and as 50erasure points in the second column. In this case, a (235,187)-RSerasure decoding process is performed on the first column.Alternatively, a (235,187)-RS decoding process is performed on thesecond column. When error correction decoding is performed on all columndirections within the RS frame by using the above-described process, the48-byte parity data which were added at the end of each column areremoved, as shown in FIG. 15(e).

As described above, even though the total number of CRC errorscorresponding to each row within the RS frame is greater than themaximum number of errors that can be corrected by the RS erasuredecoding process, when the number of bytes determined to have a lowreliability level, based upon the reliability information on thereliability map within a particular column, while performing errorcorrection decoding on the particular column. Herein, the differencebetween the general RS decoding process and the RS erasure decodingprocess is the number of errors that can be corrected. Morespecifically, when performing the general RS decoding process, thenumber of errors corresponding to half of the number of parity bytes(i.e., (number of parity bytes)/2) that are inserted during the RSencoding process may be error corrected (e.g., 24 errors may becorrected). Alternatively, when performing the RS erasure decodingprocess, the number of errors corresponding to the number of paritybytes that are inserted during the RS encoding process may be errorcorrected (e.g., 48 errors may be corrected).

After performing the error correction decoding process, as describedabove, a RS frame configured of 187 N-byte rows (or packet) may beobtained as shown in FIG. 15(e). The RS frame having the size of 187*Nbytes is outputted by the order of N number of 187-byte units. At thispoint, 1 MPEG synchronization byte, which had been removed by thetransmitting system, is added to each 187-byte packet, as shown in FIG.15(f). Therefore, a 188-byte unit enhanced data packet is outputted.Hereinafter, another error correction process will be described indetail with reference to FIG. 16.

As shown in FIG. 16(a) and FIG. 16(a′), when the RS frame having thesize of (N+2)*(187+P) bytes and the RS frame reliability map having thesize of (N+2)*(187+P) bytes are created, reference is made to areliability map with respect to the RS frame, so as to perform a RSdecoding process in a column direction. Referring to FIG. 16, since aCRC encoding process has not been performed on the enhanced data by thetransmitting system, the CRC syndrome checking process is omitted.Therefore, a CRC error flag which is to be referred to during the RSdecoding process does not exist. In other words, the system is unable todetermine whether an error exists in each row or not. Therefore, inperforming RS decoding in each column as shown in FIG. 16, the RSdecoding process is performed by referring to a reliability map, whichwas created along with the RS frame by using the soft decision value.

FIG. 16(b) and FIG. 16(b′) respectively illustrate more detailed viewsof the RS frame having the size of (N+2)*(187+P) bytes and the RS framereliability map having the size of (N+2)*(187+P) bytes. Herein, FIG.16(b) and FIG. 16(b′) represent the same RS frame and RS framereliability map as those shown in FIG. 16(a) and FIG. 16(a′). Morespecifically, the RS frame decoder compares an absolute value of thesoft decision value of the block decoder 304 with a pre-determinedthreshold value, so as to determine the reliability of bit value, whichis decided by a code of the corresponding soft decision value. Further,8 bits determined by the codes of the soft decision values are groupedto form a byte. And, the reliability information of the correspondingbyte is marked in the reliability map. Therefore, the present inventiondetermines a data byte to be erroneous (or to have errors includedtherein) when the system decides that the corresponding data byte is notreliable based upon the reliability information within the reliabilitymap, as shown in FIG. 16(c). More specifically, only the data bytesdetermined to be unreliable based upon the reliability informationwithin the reliability map are set as erasure points.

Thereafter, when the number of error points for each column is equal toor smaller than the maximum number (P) of errors that can be correctedby RS erasure decoding (e.g., when P=48), a RS erasure decoding processis performed on the corresponding column. Conversely, when the number oferror points for each column is greater than the maximum number (P) oferrors that can be corrected by RS erasure decoding (e.g., when P=48), ageneral RS decoding process is performed on the corresponding column.For example, it is assumed that the number of erasure points decidedbased upon the reliability information of the reliability map within theRS frame is marked as ‘40’ in the first column and marked as ‘50’ in thesecond column. Then, (235,187)-RS erasure decoding is performed on thefirst column, and (235,187)-RS decoding is performed on the secondcolumn.

Meanwhile, in decoding each column, another method of referring to thereliability information includes performing a general RS decodingprocess, when the number of unreliable data bytes is smaller than P/2,performing a RS erasure decoding process, when the number of unreliabledata bytes is greater than P/2 and smaller than P, and performing ageneral RS decoding process, when the number of unreliable data bytes isgreater than P. At this point, depending upon the threshold valuedeciding the reliability information or other particular situations, thefirst reference method may provide a more enhanced performance.Alternatively, in other case, the second reference method may providebetter performance.

The selecting of the appropriate RS decoding method does not only applyin the structure shown in FIG. 16. The selecting of the appropriate andeffective RS decoding method also applies in the structure shown in FIG.15. More specifically, only the method of decoding all of the columnswith the same erasure point, when the number of CRC errors is smallerthan P, is described and illustrated in FIG. 15. However, as anotherdecoding method, the process may be more fractionalized even when thenumber of CRC errors is smaller than or equal to P. In other words, a RSdecoding process is performed, when the number of CRC errors is smallerthan or equal to P/2. And, a RS erasure decoding process may beperformed, when the number of CRC errors is greater than P/2 and smallerthan or equal to P. Similarly, when the number of CRC errors is greaterthan P, reference is made to both CRC error information and reliabilityinformation of each data byte within the reliability map. Accordingly,when the number of data bytes included in a row indicating the CRC errorand, at the same time, determined to have unreliable reliabilityinformation is smaller than or equal to P/2, a RS decoding process isperformed. When the number of such data bytes is greater than P/2 andsmaller than or equal to P, a RS erasure decoding process is performed.Finally, when the number of such data bytes is greater than P, a RSdecoding process may be performed. Furthermore, according to anotherembodiment of the present invention, based upon whether the number ofunreliable data bytes is smaller than or equal to P or whether thenumber of unreliable data bytes is greater than P, the system decideswhether to perform a RS erasure decoding process or a general RSdecoding process.

Meanwhile, by performing the above-described process so as to perform aerror correction decoding process in all column directions within the RSframe, 48 bytes of parity data, which were added to the last portion ofeach column, are removed, as shown in FIG. 16(d). As described above, inperforming an error correction decoding process on a specific columnwithin the corresponding RS frame, when the number of data bytes havinga low reliability level based upon the reliability information in thereliability map of the corresponding column is equal to or smaller thana maximum number of error that can be corrected by a RS erasure decodingprocess, the present invention may perform a RS erasure decoding processof the corresponding column.

After performing the error correction decoding process, as describedabove, a RS frame configured of 187 (N+2)-byte rows (i.e., packets), asshown in FIG. 16(d). The RS frame having the size of (N+2)*(187+P) bytesis outputted by the order of (N+2) number of 187-byte units. At thispoint, 1 MPEG synchronization byte, which had been removed by thetransmitting system, is added to each 187-byte packet, as shown in FIG.16(e). Therefore, a 188-byte unit enhanced data packet is outputted.

FIG. 17 illustrates a block diagram showing the structure of a digitalbroadcast receiving system according to an embodiment of the presentinvention. Referring to FIG. 17, the digital broadcast receiving systemincludes a tuner 701, a demodulating unit 702, a demultiplexer 703, anaudio decoder 704, a video decoder 705, a native TV application manager706, a channel manager 707, a channel map 708, a first memory 709, adata decoder 710, a second memory 711, a system manager 712, a databroadcasting application manager 713, a storage controller 714, and athird memory 715. Herein, the third memory 715 is a mass storage device,such as a hard disk drive (HDD) or a memory chip. The tuner 701 tunes afrequency of a specific channel through any one of an antenna, cable,and satellite. Then, the tuner 701 down-converts the tuned frequency toan intermediate frequency (IF), which is then outputted to thedemodulating unit 702. At this point, the tuner 701 is controlled by thechannel manager 707. Additionally, the result and strength of thebroadcast signal of the tuned channel are also reported to the channelmanager 707. The data that are being received by the frequency of thetuned specific channel include main data, enhanced data, and table datafor decoding the main data and enhanced data.

In the embodiment of the present invention, examples of the enhanceddata may include data provided for data service, such as Javaapplication data, HTML application data, XML data, and so on. The dataprovided for such data services may correspond either to a Java classfile for the Java application, or to a directory file designatingpositions (or locations) of such files. Furthermore, such data may alsocorrespond to an audio file and/or a video file used in eachapplication. The data services may include weather forecast services,traffic information services, stock information services, servicesproviding information quiz programs providing audience participationservices, real time poll, user interactive education programs, gamingservices, services providing information on soap opera (or TV series)synopsis, characters, original sound track, filing sites, servicesproviding information on past sports matches, profiles andaccomplishments of sports players, product information and productordering services, services providing information on broadcast programsby media type, airing time, subject, and so on. The types of dataservices described above are only exemplary and are not limited only tothe examples given herein. Furthermore, depending upon the embodiment ofthe present invention, the enhanced data may correspond to meta data.For example, the meta data use the XML application so as to betransmitted through a DSM-CC protocol.

The demodulating unit 702 performs demodulation and channel equalizationon the signal being outputted from the tuner 701, thereby identifyingthe main data and the enhanced data. Thereafter, the identified maindata and enhanced data are outputted in TS packet units. An example ofthe demodulating unit 702 is shown in FIG. 11. The demodulating unitshown in FIG. 11 is merely exemplary and the scope of the presentinvention is not limited to the examples set forth herein. In theembodiment given as an example of the present invention, only theenhanced data packet outputted from the demodulating unit 702 isinputted to the demultiplexer 703. In this case, the main data packet isinputted to another demultiplexer (not shown) that processes main datapackets. Herein, the storage controller 714 is also connected to theother demultiplexer in order to store the main data after processing themain data packets. The demultiplexer of the present invention may alsobe designed to process both enhanced data packets and main data packetsin a single demultiplexer.

The storage controller 714 is interfaced with the demultipelxer so as tocontrol instant recording, reserved (or pre-programmed) recording, timeshift, and so on of the enhanced data and/or main data. For example,when one of instant recording, reserved (or pre-programmed) recording,and time shift is set and programmed in the receiving system (orreceiver) shown in FIG. 17, the corresponding enhanced data and/or maindata that are inputted to the demultiplexer are stored in the thirdmemory 715 in accordance with the control of the storage controller 714.The third memory 715 may be described as a temporary storage area and/ora permanent storage area. Herein, the temporary storage area is used forthe time shifting function, and the permanent storage area is used for apermanent storage of data according to the user's choice (or decision).

When the data stored in the third memory 715 need to be reproduced (orplayed), the storage controller 714 reads the corresponding data storedin the third memory 715 and outputs the read data to the correspondingdemultiplexer (e.g., the enhanced data are outputted to thedemultiplexer 703 shown in FIG. 17). At this point, according to theembodiment of the present invention, since the storage capacity of thethird memory 715 is limited, the compression encoded enhanced dataand/or main data that are being inputted are directly stored in thethird memory 715 without any modification for the efficiency of thestorage capacity. In this case, depending upon the reproduction (orreading) command, the data read from the third memory 715 pass troughthe demultiplexer so as to be inputted to the corresponding decoder,thereby being restored to the initial state.

The storage controller 714 may control the reproduction (or play),fast-forward, rewind, slow motion, instant replay functions of the datathat are already stored in the third memory 715 or presently beingbuffered. Herein, the instant replay function corresponds to repeatedlyviewing scenes that the viewer (or user) wishes to view once again. Theinstant replay function may be performed on stored data and also on datathat are currently being received in real time by associating theinstant replay function with the time shift function. If the data beinginputted correspond to the analog format, for example, if thetransmission mode is NTSC, PAL, and so on, the storage controller 714compression encodes the inputted data and stored the compression-encodeddata to the third memory 715. In order to do so, the storage controller714 may include an encoder, wherein the encoder may be embodied as oneof software, middleware, and hardware. Herein, an MPEG encoder may beused as the encoder according to an embodiment of the present invention.The encoder may also be provided outside of the storage controller 714.

Meanwhile, in order to prevent illegal duplication (or copies) of theinput data being stored in the third memory 715, the storage controller714 scrambles the input data and stores the scrambled data in the thirdmemory 715. Accordingly, the storage controller 714 may include ascramble algorithm for scrambling the data stored in the third memory715 and a descramble algorithm for descrambling the data read from thethird memory 715. Herein, the definition of scramble includesencryption, and the definition of descramble includes decryption. Thescramble method may include using an arbitrary key (e.g., control word)to modify a desired set of data, and also a method of mixing signals.

Meanwhile, the demultiplexer 703 receives the real-time data outputtedfrom the demodulating unit 702 or the data read from the third memory715 and demultiplexes the received data. In the example given in thepresent invention, the demultiplexer 703 performs demultiplexing on theenhanced data packet. Therefore, in the present invention, the receivingand processing of the enhanced data will be described in detail. Itshould also be noted that a detailed description of the processing ofthe main data will be omitted for simplicity starting from thedescription of the demultiplexer 703 and the subsequent elements.

The demultiplexer 703 demultiplexes enhanced data and program specificinformation/program and system information protocol (PSI/PSIP) tablesfrom the enhanced data packet inputted in accordance with the control ofthe data decoder 710. Thereafter, the demultiplexed enhanced data andPSI/PSIP tables are outputted to the data decoder 710 in a sectionformat. In order to extract the enhanced data from the channel throughwhich enhanced data are transmitted and to decode the extracted enhanceddata, system information is required. Such system information may alsobe referred to as service information. The system information mayinclude channel information, event information, etc. In the embodimentof the present invention, the PSI/PSIP tables are applied as the systeminformation. However, the present invention is not limited to theexample set forth herein. More specifically, regardless of the name, anyprotocol transmitting system information in a table format may beapplied in the present invention.

The PSI table is an MPEG-2 system standard defined for identifying thechannels and the programs. The PSIP table is an advanced televisionsystems committee (ATSC) standard that can identify the channels and theprograms. The PSI table may include a program association table (PAT), aconditional access table (CAT), a program map table (PMT), and a networkinformation table (NIT). Herein, the PAT corresponds to specialinformation that is transmitted by a data packet having a PID of ‘0’.The PAT transmits PID information of the PMT and PID information of theNIT corresponding to each program. The CAT transmits information on apaid broadcast system used by the transmitting system. The PMT transmitsPID information of a transport stream (TS) packet, in which programidentification numbers and individual bit sequences of video and audiodata configuring the corresponding program are transmitted, and the PIDinformation, in which PCR is transmitted. The NIT transmits informationof the actual transmission network.

The PSIP table may include a virtual channel table (VCT), a system timetable (STT), a rating region table (RRT), an extended text table (ETT),a direct channel change table (DCCT), an event information table (EIT),and a master guide table (MGT). The VCT transmits information on virtualchannels, such as channel information for selecting channels andinformation such as packet identification (PID) numbers for receivingthe audio and/or video data. More specifically, when the VCT is parsed,the PID of the audio/video data of the broadcast program may be known.Herein, the corresponding audio/video data are transmitted within thechannel along with the channel name and the channel number. The STTtransmits information on the current data and timing information. TheRRT transmits information on region and consultation organs for programratings. The ETT transmits additional description of a specific channeland broadcast program. The EIT transmits information on virtual channelevents (e.g., program title, program start time, etc.). The DCCT/DCCSCTtransmits information associated with automatic (or direct) channelchange. And, the MGT transmits the versions and PID information of theabove-mentioned tables included in the PSIP.

Each of the above-described tables included in the PSI/PSIP isconfigured of a basic unit referred to as a “section” and a combinationof one or more sections forms a table. For example, the VCT may bedivided into 256 sections. Herein, one section may include a pluralityof virtual channel information. However, a single set of virtual channelinformation is not divided into two or more sections. At this point, thereceiving system may parse and decode the data for the data service thatare transmitting by using only the tables included in the PSI, or onlythe tables included in the PISP, or a combination of tables included inboth the PSI and the PSIP. In order to parse and decode the data for thedata service, at least one of the PAT and PMT included in the PSI, andthe VCT included in the PSIP is required. For example, the PAT mayinclude the system information for transmitting the data correspondingto the data service, and the PID of the PMT corresponding to the dataservice data (or program number) The PMT may include the PID of the TSpacket used for transmitting the data service data. The VCT may includeinformation on the virtual channel for transmitting the data servicedata, and the PID of the TS packet for transmitting the data servicedata.

Meanwhile, depending upon the embodiment of the present invention, aDVB-SI may be applied instead of the PSIP. The DVB-SI may include anetwork information table (NIT), a service description table (SDT), anevent information table (EIT), and a time and data table (TDT). TheDVB-SI may be used in combination with the above-described PSI. Herein,the NIT divides the services corresponding to particular networkproviders by specific groups. The NIT includes all tuning informationthat are used during the IRD set-up. The NIT may be used for informingor notifying any change in the tuning information. The SDT includes theservice name and different parameters associated with each servicecorresponding to a particular MPEG multiplex. The EIT is used fortransmitting information associated with all events occurring in theMPEG multiplex. The EIT includes information on the current transmissionand also includes information selectively containing differenttransmission streams that may be received by the IRD. And, the TDT isused for updating the clock included in the IRD.

Furthermore, three selective SI tables (i.e., a bouquet associate table(BAT), a running status table (RST), and a stuffing table (ST)) may alsobe included. More specifically, the bouquet associate table (BAT)provides a service grouping method enabling the IRD to provide servicesto the viewers. Each specific service may belong to at least one‘bouquet’ unit. A running status table (RST) section is used forpromptly and instantly updating at least one event execution status. Theexecution status section is transmitted only once at the changing pointof the event status. Other SI tables are generally transmitted severaltimes. The stuffing table (ST) may be used for replacing or discarding asubsidiary table or the entire SI tables.

In the present invention, the enhanced data included in the payloadwithin the TS packet consist of a digital storage media-command andcontrol (DSM-CC) section format. However, the TS packet including thedata service data may correspond either to a packetized elementarystream (PES) type or to a section type. More specifically, either thePES type data service data configure the TS packet, or the section typedata service data configure the TS packet. The TS packet configured ofthe section type data will be given as the example of the presentinvention. At this point, the data service data are includes in thedigital storage media-command and control (DSM-CC) section. Herein, theDSM-CC section is then configured of a 188-byte unit TS packet.

Furthermore, the packet identification of the TS packet configuring theDSM-CC section is included in a data service table (DST). Whentransmitting the DST, ‘0x95’ is assigned as the value of a stream_typefield included in the service location descriptor of the PMT or the VCT.More specifically, when the PMT or VCT stream_type field value is‘0x95’, the receiving system may acknowledge that data broadcastingincluding enhanced data (i.e., the enhanced data) is being received. Atthis point, the enhanced data may be transmitted by a data carouselmethod. The data carousel method corresponds to repeatedly transmittingidentical data on a regular basis.

At this point, according to the control of the data decoder 710, thedemultiplexer 703 performs section filtering, thereby discardingrepetitive sections and outputting only the non-repetitive sections tothe data decoder 710. The demultiplexer 703 may also output only thesections configuring desired tables (e.g., VCT) to the data decoder 710by section filtering. Herein, the VCT may include a specific descriptorfor the enhanced data. However, the present invention does not excludethe possibilities of the enhanced data being included in other tables,such as the PMT. The section filtering method may include a method ofverifying the PID of a table defined by the MGT, such as the VCT, priorto performing the section filtering process. Alternatively, the sectionfiltering method may also include a method of directly performing thesection filtering process without verifying the MGT, when the VCTincludes a fixed PID (i.e., a base PID). At this point, thedemultiplexer 703 performs the section filtering process by referring toa table_id field, a version_number field, a section_number field, etc.

As described above, the method of defining the PID of the VCT broadlyincludes two different methods. Herein, the PID of the VCT is a packetidentifier required for identifying the VCT from other tables. The firstmethod consists of setting the PID of the VCT so that it is dependent tothe MGT. In this case, the receiving system cannot directly verify theVCT among the many PSI and/or PSIP tables. Instead, the receiving systemmust check the PID defined in the MGT in order to read the VCT. Herein,the MGT defines the PID, size, version number, and so on, of diversetables. The second method consists of setting the PID of the VCT so thatthe PID is given a base PID value (or a fixed PID value), thereby beingindependent from the MGT. In this case, unlike in the first method, theVCT according to the present invention may be identified without havingto verify every single PID included in the MGT. Evidently, an agreementon the base PID must be previously made between the transmitting systemand the receiving system.

Meanwhile, in the embodiment of the present invention, the demultiplexer703 may output only an application information table (AIT) to the datadecoder 710 by section filtering. The AIT includes information on anapplication being operated in the receiving system for the data service.The AIT may also be referred to as an XAIT, and an AMT. Therefore, anytable including application information may correspond to the followingdescription. When the AIT is transmitted, a value of ‘0x05’ may beassigned to a stream_type field of the PMT. The AIT may includeapplication information, such as application name, application version,application priority, application ID, application status (i.e.,auto-start, user-specific settings, kill, etc.), application type (i.e.,Java or HTML), position (or location) of stream including applicationclass and data files, application platform directory, and location ofapplication icon.

In the method for detecting application information for the data serviceby using the AIT, component_tag, original_network_id,transport_stream_id, and service_id fields may be used for detecting theapplication information. The component_tag field designates anelementary stream carrying a DSI of a corresponding object carousel. Theoriginal_network_id field indicates a DVB-SI original_network_id of theTS providing transport connection. The transport_stream_id fieldindicates the MPEG TS of the TS providing transport connection, and theservice_id field indicates the DVB-SI of the service providing transportconnection. Information on a specific channel may be obtained by usingthe original_network_id field, the transport_stream_id field, and theservice_id field. The data service data, such as the application data,detected by using the above-described method may be stored in the secondmemory 711 by the data decoder 710.

The data decoder 710 parses the DSM-CC section configuring thedemultiplexed enhanced data. Then, the enhanced data corresponding tothe parsed result are stored as a database in the second memory 711. Thedata decoder 710 groups a plurality of sections having the same tableidentification (table_id) so as to configure a table, which is thenparsed. Thereafter, the parsed result is stored as a database in thesecond memory 711. At this point, by parsing data and/or sections, thedata decoder 710 reads all of the remaining actual section data that arenot section-filtered by the demultiplexer 703. Then, the data decoder710 stores the read data to the second memory 711. The second memory 711corresponds to a table and data carousel database storing systeminformation parsed from tables and enhanced data parsed from the DSM-CCsection. Herein, a table_id field, a section_number field, and alast_section_number field included in the table may be used to indicatewhether the corresponding table is configured of a single section or aplurality of sections. For example, TS packets having the PID of the VCTare grouped to form a section, and sections having table identifiersallocated to the VCT are grouped to form the VCT.

When the VCT is parsed, information on the virtual channel to whichenhanced data are transmitted may be obtained. The obtained applicationidentification information, service component identificationinformation, and service information corresponding to the data servicemay either be stored in the second memory 711 or be outputted to thedata broadcasting application manager 713. In addition, reference may bemade to the application identification information, service componentidentification information, and service information in order to decodethe data service data. Alternatively, such information may also preparethe operation of the application program for the data service.Furthermore, the data decoder 710 controls the demultiplexing of thesystem information table, which corresponds to the information tableassociated with the channel and events. Thereafter, an A.V PID list maybe transmitted to the channel manager 707.

The channel manager 707 may refer to the channel map 708 in order totransmit a request for receiving system-related information data to thedata decoder 710, thereby receiving the corresponding result. Inaddition, the channel manager 707 may also control the channel tuning ofthe tuner 701. Furthermore, the channel manager 707 may directly controlthe demultiplexer 703, so as to set up the A/V PID, thereby controllingthe audio decoder 704 and the video decoder 705. The audio decoder 704and the video decoder 705 may respectively decode and output the audiodata and video data demultiplexed from the main data packet.Alternatively, the audio decoder 704 and the video decoder 705 mayrespectively decode and output the audio data and video datademultiplexed from the enhanced data packet. Meanwhile, when theenhanced data include data service data, and also audio data and videodata, it is apparent that the audio data and video data demultiplexed bythe demultiplexer 703 are respectively decoded by the audio decoder 704and the video decoder 705. For example, an audio-coding (AC)-3 decodingalgorithm may be applied to the audio decoder 704, and a MPEG-2 decodingalgorithm may be applied to the video decoder 705.

Meanwhile, the native TV application manager 706 operates a nativeapplication program stored in the first memory 709, thereby performinggeneral functions such as channel change. The native application programrefers to software stored in the receiving system upon shipping of theproduct. More specifically, when a user request (or command) istransmitted to the receiving system through a user interface (UI), thenative TV application manger 706 displays the user request on a screenthrough a graphic user interface (GUI), thereby responding to the user'srequest. The user interface receives the user request through an inputdevice, such as a remote controller, a key pad, a jog controller, an atouch-screen provided on the screen, and then outputs the received userrequest to the native TV application manager 706 and the databroadcasting application manager 713. Furthermore, the native TVapplication manager 706 controls the channel manager 707, therebycontrolling channel-associated, such as the management of the channelmap 708, and controlling the data decoder 710. The native TV applicationmanager 706 also controls the GUI of the overall receiving system,thereby storing the user request and status of the receiving system inthe first memory 709 and restoring the stored information.

The channel manager 707 controls the tuner 701 and the data decoder 710,so as to managing the channel map 708 so that it can respond to thechannel request made by the user. More specifically, channel manager 707sends a request to the data decoder 710 so that the tables associatedwith the channels that are to be tuned are parsed. The results of theparsed tables are reported to the channel manager 707 by the datadecoder 710. Thereafter, based on the parsed results, the channelmanager 707 updates the channel map 708 and sets up a PID in thedemultiplexer 703 for demultiplexing the tables associated with the dataservice data from the enhanced data.

The system manager 712 controls the booting of the receiving system byturning the power on or off. Then, the system manager 712 stores ROMimages (including downloaded software images) in the first memory 709.More specifically, the first memory 709 stores management programs suchas operating system (OS) programs required for managing the receivingsystem and also application program executing data service functions.The application program is a program processing the data service datastored in the second memory 711 so as to provide the user with the dataservice. If the data service data are stored in the second memory 711,the corresponding data service data are processed by the above-describedapplication program or by other application programs, thereby beingprovided to the user. The management program and application programstored in the first memory 709 may be updated or corrected to a newlydownloaded program. Furthermore, the storage of the stored managementprogram and application program is maintained without being deleted evenif the power of the system is shut down. Therefore, when the power issupplied the programs may be executed without having to be newlydownloaded once again.

The application program for providing data service according to thepresent invention may either be initially stored in the first memory 709upon the shipping of the receiving system, or be stored in the first 709after being downloaded. The application program for the data service(i.e., the data service providing application program) stored in thefirst memory 709 may also be deleted, updated, and corrected.Furthermore, the data service providing application program may bedownloaded and executed along with the data service data each time thedata service data are being received.

When a data service request is transmitted through the user interface,the data broadcasting application manager 713 operates the correspondingapplication program stored in the first memory 709 so as to process therequested data, thereby providing the user with the requested dataservice. And, in order to provide such data service, the databroadcasting application manager 713 supports the graphic user interface(GUI). Herein, the data service may be provided in the form of text (orshort message service (SMS)), voice message, still image, and movingimage. The data broadcasting application manager 713 may be providedwith a platform for executing the application program stored in thefirst memory 709. The platform may be, for example, a Java virtualmachine for executing the Java program. Hereinafter, an example of thedata broadcasting application manager 713 executing the data serviceproviding application program stored in the first memory 709, so as toprocess the data service data stored in the second memory 711, therebyproviding the user with the corresponding data service will now bedescribed in detail.

Assuming that the data service corresponds to a traffic informationservice, the data service according to the present invention is providedto the user of a receiving system that is not equipped with anelectronic map and/or a GPS system in the form of at least one of a text(or short message service (SMS)), a voice message, a graphic message, astill image, and a moving image. In this case, is a GPS module ismounted on the receiving system shown in FIG. 17, the GPS modulereceives satellite signals transmitted from a plurality of low earthorbit satellites and extracts the current position (or location)information (e.g., longitude, latitude, altitude), thereby outputtingthe extracted information to the data broadcasting application manager713.

At this point, it is assumed that the electronic map includinginformation on each link and nod and other diverse graphic informationare stored in one of the second memory 711, the first memory 709, andanother memory that is not shown. More specifically, according to therequest made by the data broadcasting application manager 713, the dataservice data stored in the second memory 711 are read and inputted tothe data broadcasting application manager 713. The data broadcastingapplication manager 713 translates (or deciphers) the data service dataread from the second memory 711, thereby extracting the necessaryinformation according to the contents of the message and/or a controlsignal.

FIG. 18 illustrates a block diagram showing the structure of a digitalbroadcast (or television) receiving system according to anotherembodiment of the present invention. Referring to FIG. 18, the digitalbroadcast receiving system includes a tuner 801, a demodulating unit802, a demultiplexer 803, a first descrambler 804, an audio decoder 805,a video decoder 806, a second descrambler 807, an authentication unit808, a native TV application manager 809, a channel manager 810, achannel map 811, a first memory 812, a data decoder 813, a second memory814, a system manager 815, a data broadcasting application manager 816,a storage controller 817, a third memory 818, and a telecommunicationmodule 819. Herein, the third memory 818 is a mass storage device, suchas a hard disk drive (HDD) or a memory chip. Also, during thedescription of the digital broadcast (or television or DTV) receivingsystem shown in FIG. 18, the components that are identical to those ofthe digital broadcast receiving system of FIG. 17 will be omitted forsimplicity.

As described above, in order to provide services for preventing illegalduplication (or copies) or illegal viewing of the enhanced data and/ormain data that are transmitted by using a broadcast network, and toprovide paid broadcast services, the transmitting system may generallyscramble and transmit the broadcast contents. Therefore, the receivingsystem needs to descrample the scrambled broadcast contents in order toprovide the user with the proper broadcast contents. Furthermore, thereceiving system may generally be processed with an authenticationprocess with an authentication means before the descrambling process.Hereinafter, the receiving system including an authentication means anda descrambling means according to an embodiment of the present inventionwill now be described in detail.

According to the present invention, the receiving system may be providedwith a descrambling means receiving scrambled broadcasting contents andan authentication means authenticating (or verifying) whether thereceiving system is entitled to receive the descrambled contents.Hereinafter, the descrambling means will be referred to as first andsecond descramblers 804 and 807, and the authentication means will bereferred to as an authentication unit 808. Such naming of thecorresponding components is merely exemplary and is not limited to theterms suggested in the description of the present invention. Forexample, the units may also be referred to as a decryptor. Although FIG.18 illustrates an example of the descramblers 804 and 807 and theauthentication unit 808 being provided inside the receiving system, eachof the descramblers 804 and 807 and the authentication unit 808 may alsobe separately provided in an internal or external module. Herein, themodule may include a slot type, such as a SD or CF memory, a memorystick type, a USB type, and so on, and may be detachably fixed to thereceiving system.

As described above, when the authentication process is performedsuccessfully by the authentication unit 808, the scrambled broadcastingcontents are descrambled by the descramblers 804 and 807, thereby beingprovided to the user. At this point, a variety of the authenticationmethod and descrambling method may be used herein. However, an agreementon each corresponding method should be made between the receiving systemand the transmitting system. Hereinafter, the authentication anddescrambling methods will now be described, and the description ofidentical components or process steps will be omitted for simplicity.

The receiving system including the authentication unit 808 and thedescramblers 804 and 807 will now be described in detail. The receivingsystem receives the scrambled broadcasting contents through the tuner801 and the demodulating unit 802. Then, the system manager 815 decideswhether the received broadcasting contents have been scrambled. Herein,the demodulating unit 802 may be included as a demodulating meanaccording to an embodiment of the present invention as described in FIG.11. However, the present invention is not limited to the examples givenin the description set forth herein. If the system manager 815 decidesthat the received broadcasting contents have been scrambled, then thesystem manager 815 controls the system to operate the authenticationunit 808. As described above, the authentication unit 808 performs anauthentication process in order to decide whether the receiving systemaccording to the present invention corresponds to a legitimate hostentitled to receive the paid broadcasting service. Herein, theauthentication process may vary in accordance with the authenticationmethods.

For example, the authentication unit 808 may perform the authenticationprocess by comparing an IP address of an IP datagram within the receivedbroadcasting contents with a specific address of a corresponding host.At this point, the specific address of the corresponding receivingsystem (or host) may be a MAC address. More specifically, theauthentication unit 808 may extract the IP address from the decapsulatedIP datagram, thereby obtaining the receiving system information that ismapped with the IP address. At this point, the receiving system shouldbe provided, in advance, with information (e.g., a table format) thatcan map the IP address and the receiving system information.Accordingly, the authentication unit 808 performs the authenticationprocess by determining the conformity between the address of thecorresponding receiving system and the system information of thereceiving system that is mapped with the IP address. In other words, ifthe authentication unit 808 determines that the two types of informationconform to one another, then the authentication unit 808 determines thatthe receiving system is entitled to receive the correspondingbroadcasting contents.

In another example, standardized identification information is definedin advance by the receiving system and the transmitting system. Then,the identification information of the receiving system requesting thepaid broadcasting service is transmitted by the transmitting system.Thereafter, the receiving system determines whether the receivedidentification information conforms with its own unique identificationnumber, so as to perform the authentication process. More specifically,the transmitting system creates a database for storing theidentification information (or number) of the receiving systemrequesting the paid broadcasting service. Then, if the correspondingbroadcasting contents are scrambled, the transmitting system includesthe identification information in the EMM, which is then transmitted tothe receiving system.

If the corresponding broadcasting contents are scrambled, messages(e.g., entitlement control message (ECM), entitlement management message(EMM)), such as the CAS information, mode information, message positioninformation, that are applied to the scrambling of the broadcastingcontents are transmitted through a corresponding data header or antherdata packet. The ECM may include a control word (CW) used for scramblingthe broadcasting contents. At this point, the control word may beencoded with an authentication key. The EMM may include anauthentication key and entitlement information of the correspondingdata. Herein, the authentication key may be encoded with a receivingsystem-specific distribution key. In other words, assuming that theenhanced data are scrambled by using the control word, and that theauthentication information and the descrambling information aretransmitted from the transmitting system, the transmitting systemencodes the CW with the authentication key and, then, includes theencoded CW in the entitlement control message (ECM), which is thentransmitted to the receiving system. Furthermore, the transmittingsystem includes the authentication key used for encoding the CW and theentitlement to receive data (or services) of the receiving system (i.e.,a standardized serial number of the receiving system that is entitled toreceive the corresponding broadcasting service or data) in theentitlement management message (EMM), which is then transmitted to thereceiving system.

Accordingly, the authentication unit 808 of the receiving systemextracts the identification information of the receiving system and theidentification information included in the EMM of the broadcastingservice that is being received. Then, the authentication unit 808determines whether the identification information conform to each other,so as to perform the authentication process. More specifically, if theauthentication unit 808 determines that the information conform to eachother, then the authentication unit 808 eventually determines that thereceiving system is entitled to receive the request broadcastingservice.

In yet another example, the authentication unit 808 of the receivingsystem may be detachably fixed to an external module. In this case, thereceiving system is interfaced with the external module through a commoninterface (CI). In other words, the external module may receive the datascrambled by the receiving system through the common interface, therebyperforming the descrambling process of the received data. Alternatively,the external module may also transmit only the information required forthe descrambling process to the receiving system. The common interfaceis configured on a physical layer and at least one protocol layer.Herein, in consideration of any possible expansion of the protocol layerin a later process, the corresponding protocol layer may be configuredto have at least one layer that can each provide an independentfunction.

The external module may either consist of a memory or card havinginformation on the key used for the scrambling process and otherauthentication information but not including any descrambling function,or consist of a card having the above-mentioned key information andauthentication information and including the descrambling function. Boththe receiving system and the external module should be authenticated inorder to provide the user with the paid broadcasting service provided(or transmitted) from the transmitting system. Therefore, thetransmitting system can only provide the corresponding paid broadcastingservice to the authenticated pair of receiving system and externalmodule.

Additionally, an authentication process should also be performed betweenthe receiving system and the external module through the commoninterface. More specifically, the module may communicate with the systemmanager 815 included in the receiving system through the commoninterface, thereby authenticating the receiving system. Alternatively,the receiving system may authenticate the module through the commoninterface. Furthermore, during the authentication process, the modulemay extract the unique ID of the receiving system and its own unique IDand transmit the extracted IDs to the transmitting system. Thus, thetransmitting system may use the transmitted ID values as informationdetermining whether to start the requested service or as paymentinformation. Whenever necessary, the system manager 815 transmits thepayment information to the remote transmitting system through thetelecommunication module 819.

The authentication unit 808 authenticates the corresponding receivingsystem and/or the external module. Then, if the authentication processis successfully completed, the authentication unit 808 certifies thecorresponding receiving system and/or the external module as alegitimate system and/or module entitled to receive the requested paidbroadcasting service. In addition, the authentication unit 808 may alsoreceive authentication-associated information from a mobiletelecommunications service provider to which the user of the receivingsystem is subscribed, instead of the transmitting system providing therequested broadcasting service. In this case, theauthentication-association information may either be scrambled by thetransmitting system providing the broadcasting service and, then,transmitted to the user through the mobile telecommunications serviceprovider, or be directly scrambled and transmitted by the mobiletelecommunications service provider. Once the authentication process issuccessfully completed by the authentication unit 808, the receivingsystem may descramble the scrambled broadcasting contents received fromthe transmitting system. At this point, the descrambling process isperformed by the first and second descramblers 804 and 807. Herein, thefirst and second descramblers 804 and 807 may be included in an internalmodule or an external module of the receiving system.

The receiving system is also provided with a common interface forcommunicating with the external module including the first and seconddescramblers 804 and 807, so as to perform the descrambling process.More specifically, the first and second descramblers 804 and 807 may beincluded in the module or in the receiving system in the form ofhardware, middleware or software. Herein, the descramblers 804 and 807may be included in any one of or both of the module and the receivingsystem. If the first and second descramblers 804 and 807 are providedinside the receiving system, it is advantageous to have the transmittingsystem (i.e., at least any one of a service provider and a broadcaststation) scramble the corresponding data using the same scramblingmethod.

Alternatively, if the first and second descramblers 804 and 807 areprovided in the external module, it is advantageous to have eachtransmitting system scramble the corresponding data using differentscrambling methods. In this case, the receiving system is not requiredto be provided with the descrambling algorithm corresponding to eachtransmitting system. Therefore, the structure and size of receivingsystem may be simplified and more compact. Accordingly, in this case,the external module itself may be able to provide CA functions, whichare uniquely and only provided by each transmitting systems, andfunctions related to each service that is to be provided to the user.The common interface enables the various external modules and the systemmanager 815, which is included in the receiving system, to communicatewith one another by a single communication method. Furthermore, sincethe receiving system may be operated by being connected with at leastone or more modules providing different services, the receiving systemmay be connected to a plurality of modules and controllers.

In order to maintain successful communication between the receivingsystem and the external module, the common interface protocol includes afunction of periodically checking the status of the oppositecorrespondent. By using this function, the receiving system and theexternal module is capable of managing the status of each oppositecorrespondent. This function also reports the user or the transmittingsystem of any malfunction that may occur in any one of the receivingsystem and the external module and attempts the recovery of themalfunction.

In yet another example, the authentication process may be performedthrough software. More specifically, when a memory card having CASsoftware downloaded, for example, and stored therein in advanced isinserted in the receiving system, the receiving system receives andloads the CAS software from the memory card so as to perform theauthentication process. In this example, the CAS software is read outfrom the memory card and stored in the first memory 812 of the receivingsystem. Thereafter, the CAS software is operated in the receiving systemas an application program. According to an embodiment of the presentinvention, the CAS software is mounted on (or stored) in a middlewareplatform and, then executed. A Java middleware will be given as anexample of the middleware included in the present invention. Herein, theCAS software should at least include information required for theauthentication process and also information required for thedescrambling process.

Therefore, the authentication unit 808 performs authentication processesbetween the transmitting system and the receiving system and alsobetween the receiving system and the memory card. At this point, asdescribed above, the memory card should be entitled to receive thecorresponding data and should include information on a normal receivingsystem that can be authenticated. For example, information on thereceiving system may include a unique number, such as a standardizedserial number of the corresponding receiving system. Accordingly, theauthentication unit 808 compares the standardized serial number includedin the memory card with the unique information of the receiving system,thereby performing the authentication process between the receivingsystem and the memory card.

If the CAS software is first executed in the Java middleware base, thenthe authentication between the receiving system and the memory card isperformed. For example, when the unique number of the receiving systemstored in the memory card conforms to the unique number of the receivingsystem read from the system manager 815, then the memory card isverified and determined to be a normal memory card that may be used inthe receiving system. At this point, the CAS software may either beinstalled in the first memory 812 upon the shipping of the presentinvention, or be downloaded to the first memory 812 from thetransmitting system or the module or memory card, as described above.Herein, the descrambling function may be operated by the databroadcasting application manger 816 as an application program.

Thereafter, the CAS software parses the EMM/ECM packets outputted fromthe demultiplexer 803, so as to verify whether the receiving system isentitled to receive the corresponding data, thereby obtaining theinformation required for descrambling (i.e., the CW) and providing theobtained CW to the descramblers 804 and 807. More specifically, the CASsoftware operating in the Java middleware platform first reads out theunique (or serial) number of the receiving system from the correspondingreceiving system and compares it with the unique number of the receivingsystem transmitted through the EMM, thereby verifying whether thereceiving system is entitled to receive the corresponding data. Once thereceiving entitlement of the receiving system is verified, thecorresponding broadcasting service information transmitted to the ECMand the entitlement of receiving the corresponding broadcasting serviceare used to verify whether the receiving system is entitled to receivethe corresponding broadcasting service. Once the receiving system isverified to be entitled to receive the corresponding broadcastingservice, the authentication key transmitted to the EMM is used to decode(or decipher) the encoded CW, which is transmitted to the ECM, therebytransmitting the decoded CW to the descramblers 804 and 807. Each of thedescramblers 804 and 807 uses the CW to descramble the broadcastingservice.

Meanwhile, the CAS software stored in the memory card may be expanded inaccordance with the paid service which the broadcast station is toprovide. Additionally, the CAS software may also include otheradditional information other than the information associated with theauthentication and descrambling. Furthermore, the receiving system maydownload the CAS software from the transmitting system so as to upgrade(or update) the CAS software originally stored in the memory card. Asdescribed above, regardless of the type of broadcast receiving system,as long as an external memory interface is provided, the presentinvention may embody a CAS system that can meet the requirements of alltypes of memory card that may be detachably fixed to the receivingsystem. Thus, the present invention may realize maximum performance ofthe receiving system with minimum fabrication cost, wherein thereceiving system may receive paid broadcasting contents such asbroadcast programs, thereby acknowledging and regarding the variety ofthe receiving system. Moreover, since only the minimum applicationprogram interface is required to be embodied in the embodiment of thepresent invention, the fabrication cost may be minimized, therebyeliminating the manufacturer's dependence on CAS manufacturers.Accordingly, fabrication costs of CAS equipments and management systemsmay also be minimized.

Meanwhile, the descramblers 804 and 807 may be included in the moduleeither in the form of hardware or in the form of software. In this case,the scrambled data that being received are descrambled by the module andthen demodulated. Also, if the scrambled data that are being receivedare stored in the third memory 818, the received data may be descrambledand then stored, or stored in the memory at the point of being receivedand then descrambled later on prior to being played (or reproduced).Thereafter, in case scramble/descramble algorithms are provided in thestorage controller 817, the storage controller 817 scrambles the datathat are being received once again and then stores the re-scrambled datato the third memory 818.

In yet another example, the descrambled broadcasting contents(transmission of which being restricted) are transmitted through thebroadcasting network. Also, information associated with theauthentication and descrambling of data in order to disable thereceiving restrictions of the corresponding data are transmitted and/orreceived through the telecommunications module 819. Thus, the receivingsystem is able to perform reciprocal (or two-way) communication. Thereceiving system may either transmit data to the telecommunicationmodule within the transmitting system or be provided with the data fromthe telecommunication module within the transmitting system. Herein, thedata correspond to broadcasting data that are desired to be transmittedto or from the transmitting system, and also unique information (i.e.,identification information) such as a serial number of the receivingsystem or MAC address.

The telecommunication module 819 included in the receiving systemprovides a protocol required for performing reciprocal (or two-way)communication between the receiving system, which does not support thereciprocal communication function, and the telecommunication moduleincluded in the transmitting system. Furthermore, the receiving systemconfigures a protocol data unit (PDU) using a tag-length-value (TLV)coding method including the data that are to be transmitted and theunique information (or ID information). Herein, the tag field includesindexing of the corresponding PDU. The length field includes the lengthof the value field. And, the value field includes the actual data thatare to be transmitted and the unique number (e.g., identificationnumber) of the receiving system.

The receiving system may configure a platform that is equipped with theJava platform and that is operated after downloading the Javaapplication of the transmitting system to the receiving system throughthe network. In this case, a structure of downloading the PDU includingthe tag field arbitrarily defined by the transmitting system from astorage means included in the receiving system and then transmitting thedownloaded PDU to the telecommunication module 819 may also beconfigured. Also, the PDU may be configured in the Java application ofthe receiving system and then outputted to the telecommunication module819. The PDU may also be configured by transmitting the tag value, theactual data that are to be transmitted, the unique information of thecorresponding receiving system from the Java application and byperforming the TLV coding process in the receiving system. Thisstructure is advantageous in that the firmware of the receiving systemis not required to be changed even if the data (or application) desiredby the transmitting system is added.

The telecommunication module within the transmitting system eithertransmits the PDU received from the receiving system through a wirelessdata network or configures the data received through the network into aPDU which is transmitted to the host. At this point, when configuringthe PDU that is to be transmitted to the host, the telecommunicationmodule within the transmitting end may include unique information (e.g.,IP address) of the transmitting system which is located in a remotelocation. Additionally, in receiving and transmitting data through thewireless data network, the receiving system may be provided with acommon interface, and also provided with a WAP, CDMA 1× EV-DO, which canbe connected through a mobile telecommunication base station, such asCDMA and GSM, and also provided with a wireless LAN, mobile internet,WiBro, WiMax, which can be connected through an access point. Theabove-described receiving system corresponds to the system that is notequipped with a telecommunication function. However, a receiving systemequipped with telecommunication function does not require thetelecommunication module 819.

The broadcasting data being transmitted and received through theabove-described wireless data network may include data required forperforming the function of limiting data reception. Meanwhile, thedemultiplexer 803 receives either the real-time data outputted from thedemodulating unit 802 or the data read from the third memory 818,thereby performing demultiplexing. In this embodiment of the presentinvention, the demultiplexer 803 performs demultiplexing on the enhanceddata packet. Similar process steps have already been described earlierin the description of the present invention. Therefore, a detailed ofthe process of demultiplexing the enhanced data will be omitted forsimplicity.

The first descrambler 804 receives the demultiplexed signals from thedemultiplexer 803 and then descrambles the received signals. At thispoint, the first descrambler 804 may receive the authentication resultreceived from the authentication unit 808 and other data required forthe descrambling process, so as to perform the descrambling process. Theaudio decoder 805 and the video decoder 806 receive the signalsdescrambled by the first descrambler 804, which are then decoded andoutputted. Alternatively, if the first descrambler 804 did not performthe descrambling process, then the audio decoder 805 and the videodecoder 806 directly decode and output the received signals. In thiscase, the decoded signals are received and then descrambled by thesecond descrambler 807 and processed accordingly.

As described above, the present invention has the following advantages.More specifically, the present invention is highly protected against (orresistant to) any error that may occur when transmitting supplementaldata through a channel. And, the present invention is also highlycompatible to the conventional receiving system. Moreover, the presentinvention may also receive the supplemental data without any error evenin channels having severe ghost effect and noise.

Additionally, by performing an error correction encoding process and byperforming interleaving in super frame units and transmitting theprocessed data, robustness is provided to the enhanced data, therebyenabling the enhanced data to respond adequately and strongly againstthe fast and frequent change in channels. Most particularly, by creatinga reliability map when performing error correction decoding on thereceived data, and by performing the error correction decoding processwhile referring to the reliability information of the reliability map,the error correction performance on the received enhanced data may beenhanced. Furthermore, the present invention is even more effective whenapplied to mobile and portable receivers, which are also liable to afrequent change in channel and which require protection (or resistance)against intense noise.

It will be apparent to those skilled in the art that variousmodifications and variations can be made in the present inventionwithout departing from the spirit or scope of the inventions. Thus, itis intended that the present invention covers the modifications andvariations of this invention provided they come within the scope of theappended claims and their equivalents.

1. A digital television (DTV) transmitting system for processingbroadcast data, the DTV transmitting system comprising: a first frameencoder forming first enhanced data frames and encoding each firstenhanced data frame for error correction, the first frame encoderfurther forming a first super frame by combining the encoded firstenhanced data frames and interleaving the first super frame; a secondframe encoder forming second enhanced data frames and encoding eachsecond enhanced data frame for error correction, the second frameencoder further forming a second super frame by combining the encodedsecond enhanced data frames and interleaving the second super frame; anda frame multiplexer multiplexing the interleaved first enhanced dataframes and the interleaved second enhanced data frames.
 2. The DTVtransmitting system of claim 1, further comprising a block processorencoding the multiplexed enhanced data frames at a rate of 1/H, wherein1<H.
 3. The DTV transmitting system of claim 2, further comprising agroup formatter forming a group of enhanced data having one more dataregions and inserting the enhanced data encoded at the rate of 1/H intoat least one of the data regions.
 4. The DTV transmitting system ofclaim 3, further comprising a data deinterleaver deinterleaving thegroup of enhanced data.
 5. The DTV transmitting system of claim 4,further comprising a packet formatter formatting the deinterleavedenhanced data into enhanced data packets.
 6. A method of processingbroadcast data in a digital television (DTV) transmitting system, themethod comprising: forming first enhanced data frames and encoding eachfirst enhanced data frame for error correction; forming a first superframe by combining the encoded first enhanced data frames andinterleaving the first super frame; forming second enhanced data framesand encoding each second enhanced data frame for error correction;forming a second super frame by combining the encoded second enhanceddata frames and interleaving the second super frame; and multiplexingthe interleaved first enhanced data frames and the interleaved secondenhanced data frames.
 7. The method of claim 6, further comprisingencoding the multiplexed enhanced data frames at a rate of 1/H, wherein1<H.
 8. The method of claim 7, further comprising forming a group ofenhanced data having one or more data regions and inserting the enhanceddata encoded at the rate of 1/H into at least one of the data regions.9. The method of claim 8, further comprising deinterleaving the group ofenhanced data.
 10. The method of claim 9, further comprising formattingthe deinterleaved enhanced data into enhanced data packets.
 11. Adigital television (DTV) receiving system for processing broadcast data,the DTV receiving system comprising: a tuner receiving a digitalbroadcast signal including enhanced data and main data; a demodulatordemodulating the digital broadcast signal; an equalizer equalizing thedemodulated signal; a block decoder decoding each block of enhanced datain the equalized signal; a frame demultiplexer demultiplexing thedecoded enhanced data into a first super frame and a second super frame;a first frame decoder deinterleaving the first super frame and decodingeach of first enhanced data frames included in the first super frame forerror correction; and a second frame decoder deinterleaving the secondsuper frame and decoding each of second enhanced data frames included inthe second super frame for error correction.
 12. The DTV receivingsystem of claim 11, wherein the first frame decoder is a Reed-Solomon(RS) decoder which removes parity data from each of the first enhanceddata frames.
 13. The DTV receiving system of claim 11, wherein thesecond frame decoder is a Reed-Solomon (RS) decoder which removes paritydata from each of the second enhanced data frames.
 14. A method ofprocessing broadcast data in a digital television (DTV) receivingsystem, the method comprising: tuning to a channel to receive a digitalbroadcast signal including enhanced data and main data; demodulating thedigital broadcast signal; equalizing the demodulated signal; decodingeach block of enhanced data in the equalized signal; demultiplexing thedecoded enhanced data into a first super frame and a second super frame;deinterleaving the first super frame and decoding each of first enhanceddata frames included in the first super frame for error correction; anddeinterleaving the second super frame and decoding each of secondenhanced data frames included in the second super frame for errorcorrection.
 15. The method of claim 14, wherein decoding each of firstenhanced data frames included in the first super frame for errorcorrection comprises performing Reed-Solomon (RS) decoding on each ofthe first enhanced data frames.
 16. The method of claim 14, whereindecoding each of second enhanced data frames included in the secondsuper frame for error correction comprises performing Reed-Solomon (RS)decoding on each of the second enhanced data frames.